Fast Enumeration Algorithm for Multivariate Polynomials over General Finite Fields
From MaRDI portal
Fast Enumeration Algorithm for Multivariate Polynomials over General Finite Fields
Recommendations
Cites work
- A crossbred algorithm for solving Boolean polynomial systems
- A New Variant of Unbalanced Oil and Vinegar Using Quotient Ring: QR-UOV
- Beating brute force for systems of polynomial equations over finite fields
- Cryptanalysis of Rainbow
- Efficient algorithms for solving overdefined systems of multivariate polynomial equations
- Efficient generation of the binary reflected gray code and its applications
- Efficient key recovery for all HFE signature variants
- Fast exhaustive search for polynomial systems in \({\mathbb{F}_2}\)
- Fast exhaustive search for quadratic systems in \(\mathbb {F}_2\) on FPGAs
- scientific article; zbMATH DE number 1583768 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Hybrid approach for solving multivariate systems over finite fields
- Improved cryptanalysis of UOV and Rainbow
- On the complexity of ``Superdetermined minrank instances
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- The Magma algebra system. I: The user language
Cited in
(1)
This page was built for publication: Fast Enumeration Algorithm for Multivariate Polynomials over General Finite Fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6493392)