- This project aims to:
- search for primitive polynomials over given finity field 'GF(p^m)'
- judge whether a polynomial is primitive or not
- The project is based on Flask and Galois.
- Many Thanks to the Authors!
- Before you first use this application, please type the following commands to initialize it:
- 'chmod +x run.sh'
- './run.sh'
- Please type the following commands to start this program:
- '. venv/bin/activate'
- 'python app.py'
- Then click on the link 'http://localhost:5050/'.
- The website provides five services:
- Find All: Search For All Primitive Polynomials over GF(p^m)
- Find One: Search For A Primitive Polynomial over GF(p^m)
- Num-Term: Search For Num-Term Primitive Polynomials Over GF(p^m)
- Conway: Select A Conway Polynomial Over GF(p)
- Judge: Judge Whether A Polynomial Is Primitive Over GF(p^m)
- Please select a item of the navbar by clicking on it.
- Then set values for arguments on the selected page:
- GF: 'characteristic^degree', such as '2','2^7','3^11'.
characteristic must be a prime and degree must be a positive number - Degree: the degree of the polynomials to be shown, which must be a positive number
- Limit: the number of polynomials to be shown, which must be a positive number or '-1'(All)
- Method: five options: 'order', 'reverse', 'random', 'min, and 'max'
- Submit: submit the arguments you have input
- Number Of Term: the number of term of the polynomials to be shown, which must be a positive number
- Characteristic: the characteristic of the prime field, which must be a prime
- Expression: the expression of polynomial, such as 'x', 'x^5+x^7+x^19+8x^9'
- Please type 'Ctrl-C' to quit
CanisMinor-1037