Asymmetric Cryptography with a Hidden Monomial

DOI10.1007/3-540-68697-5_4zbMath1329.94075OpenAlexW1540142749MaRDI QIDQ3452338

Jacques Patarin

Publication date: 11 November 2015

Published in: Advances in Cryptology — CRYPTO ’96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-68697-5_4

zbMATH Keywords

candidate algorithm for asymmetric signatures of length only 64 bits

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (6)

A new framework for computing Gröbner bases ⋮ On the security of biquadratic \(C^\ast\) public-key cryptosystems and its generalizations ⋮ Poly-Dragon: an efficient multivariate public key cryptosystem ⋮ Key Recovery on Hidden Monomial Multivariate Schemes ⋮ A public key cryptosystem using a group of permutation polynomials ⋮ On Dynamical Systems of Large Girth or Cycle Indicator and Their Applications to Multivariate Cryptography

Cites Work

• Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Asymmetric Cryptography with a Hidden Monomial