Accept (prime, exponent) arguments to GF constructor
See original GitHub issuep = 2**61-1
is prime. galois.GF(p*p) takes ~3 hours to return. The factory already accepts a polynomial argument, so it would be really nice if I could say galois.GF(p, [1, 0, 1])
and get on with using the quadratic extension (yes, x**2 + 1
is irreducible over GF(p)).
Issue Analytics
- State:
- Created 2 years ago
- Comments:7 (6 by maintainers)
Top Results From Across the Web
Finite Fields - Finite Rings
Sage supports arithmetic in finite prime and extension fields. ... can be created by using a different prefix keyword to the finite field...
Read more >Basic Usage — galois documentation - Read the Docs
The user creates a “Galois field array class” using GF = galois.GF(p**m) . A Galois field array class GF is a subclass of...
Read more >Finite Fields — Sage Reference Manual v8.0
Sage supports arithmetic in finite prime and extension fields. ... can be created by using a different prefix keyword to the finite field...
Read more >sagelib/constructor.py at master - GitHub
Sage supports arithmetic in finite prime and extension fields. Several implementation for prime ... `GF(p)` with the property that for a root `\alpha`....
Read more >GF Language Reference Manual - Grammatical Framework
The third idea gives GF the expressive power needed to map abstract syntax to vastly ... parameter types and parameter constructors, and operations....
Read more >
Top Related Medium Post
No results found
Top Related StackOverflow Question
No results found
Troubleshoot Live Code
Lightrun enables developers to add logs, metrics and snapshots to live code - no restarts or redeploys required.
Start Free
Top Related Reddit Thread
No results found
Top Related Hackernoon Post
No results found
Top Related Tweet
No results found
Top Related Dev.to Post
No results found
Top Related Hashnode Post
No results found
Awesome! Thanks for the quick & detailed response! Looking forward to beta testing!
I’m closing this for now due to inactivity. Please feel free to re-open with further thoughts or questions. Thanks again for the bug report!