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.

Sign up for GitHub

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

Jump to bottom

Add irreducible polynomials for GF(2^m) (2<=m<=10_000) #462

Merged
merged 3 commits into from
Jan 31, 2023
Merged

Add irreducible polynomials for GF(2^m) (2<=m<=10_000) #462

merged 3 commits into from
Jan 31, 2023

Commits on Jan 27, 2023

  1. Add irreducible polynomials for GF(2^m) 

    - New script to create a irreducible polynomials database
- Add irreducible polynomials for GF(2^m) for m <= 10_000 using Gadiel Seroussi's table
- New IrreduciblePolyDatabase class to handle access to the database
    @iyanmv
    iyanmv committed Jan 27, 2023
    Configuration menu
    Copy the full SHA
    75aeb37 View commit details
    Browse the repository at this point in the history

  2. Use IrreduciblePolyDatabase with terms="min" 

    Similar to the changes in primitive_poly(), try to fetch nonzero degrees
and coefficients from the database when irreducible_poly() is called
with terms="min". If poly is not in the database, fallback to compute
it.
    @iyanmv
    iyanmv committed Jan 27, 2023
    Configuration menu
    Copy the full SHA
    2db1e03 View commit details
    Browse the repository at this point in the history

  3. Add unit tests 

    - Add LUTs for a sample of irreducible polynomials from Gadiel Seroussi's table
- Add test_minimum_terms_from_database
    @iyanmv
    iyanmv committed Jan 27, 2023
    Configuration menu
    Copy the full SHA
    5db9da8 View commit details
    Browse the repository at this point in the history