Multivariate public key cryptosystems from Diophantine equations
From MaRDI portal
Publication:1936497
DOI10.1007/s10623-011-9582-1zbMath1286.94068OpenAlexW2159343703MaRDI QIDQ1936497
Publication date: 5 February 2013
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-011-9582-1
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Uses Software
Cites Work
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- The Magma algebra system. I: The user language
- Rainbow, a New Multivariable Polynomial Signature Scheme
- A public key system with signature and master key functions
- Unbalanced Oil and Vinegar Signature Schemes
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Information Security and Privacy
- Public Key Cryptography - PKC 2005
- High Order Linearization Equation (HOLE) Attack on Multivariate Public Key Cryptosystems
- ℓ-Invertible Cycles for $\mathcal{M}$ ultivariate $\mathcal{Q}$ uadratic ( ${\mathcal{MQ}}$ ) Public Key Cryptography
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item