Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Use the analog of UnivariatePolynomialZp64#multiplyClassicalSafeTrick for polynomials over other finite fields #16

Open
PoslavskySV opened this issue Nov 22, 2017 · 0 comments

Comments

@PoslavskySV
Copy link
Owner

This can considerably speed up arithmetic in Z/p[x] for p > 2^64 and GF[x] (used quite often)

@PoslavskySV PoslavskySV added this to the 2.1.1 milestone Nov 22, 2017
@PoslavskySV PoslavskySV modified the milestones: 2.1.1, 2.3 Dec 6, 2017
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

1 participant