-
Notifications
You must be signed in to change notification settings - Fork 278
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
Equal degree #1026
Equal degree #1026
Conversation
int mod_val = mp_get_si(modulo_); | ||
std::vector<integer_class> v(n_val + 1); | ||
for (int i = 0; i < n; ++i) { | ||
v[i] = integer_class(std::rand() % mod_val); |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
There are random number generators in GMP. We should use one of those if we are dealing with big numbers.
@isuruf left some commens. Overall it looks good. |
d389273
to
e528014
Compare
std::vector<GaloisFieldDict> b; | ||
if (modulo_ != 2_z) | ||
b = this->gf_frobenius_monomial_base(); | ||
size_t seed = 123456; |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Use std::rand()
to generate the seed.
Equal Degree Zassenhaus's algorithm