Fast Enumeration Algorithm for Multivariate Polynomials over General Finite Fields

DOI10.1007/978-3-031-40003-2_13MaRDI QIDQ6493392

Hiroki Furue, Tsuyoshi Takagi

Publication date: 26 April 2024

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Cryptography (94A60) Polynomials over finite fields (11T06) Factorization (11Y05) Quantum cryptography (quantum-theoretic aspects) (81P94)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Magma algebra system. I: The user language
• Improved cryptanalysis of UOV and Rainbow
• Efficient key recovery for all HFE signature variants
• On the complexity of ``Superdetermined minrank instances
• A crossbred algorithm for solving Boolean polynomial systems
• Fast Exhaustive Search for Quadratic Systems in $$\mathbb {F}_{2}$$ on FPGAs
• Hybrid approach for solving multivariate systems over finite fields
• Cryptanalysis of Rainbow
• Fast Exhaustive Search for Polynomial Systems in ${\mathbb{F}_2}$
• Efficient generation of the binary reflected gray code and its applications
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Beating Brute Force for Systems of Polynomial Equations over Finite Fields
• A New Variant of Unbalanced Oil and Vinegar Using Quotient Ring: QR-UOV

This page was built for publication: Fast Enumeration Algorithm for Multivariate Polynomials over General Finite Fields