A stupid implementation of non-prime fields GF(p^n) with prime p and n>1
- 
            Updated
            
Mar 16, 2023  - Python
 
A stupid implementation of non-prime fields GF(p^n) with prime p and n>1
Fibonacci LFSR in Python with 4-bit demo, reconfigurable class, period check, and % agreement helper.
Add a description, image, and links to the finite-field topic page so that developers can more easily learn about it.
To associate your repository with the finite-field topic, visit your repo's landing page and select "manage topics."