A family of weak keys in HFE and the corresponding practical key-recovery

DOI10.1515/jmc.2011.012zbMath1251.94023OpenAlexW2052575763MaRDI QIDQ3225750

Charles Bouillaguet, Joana Treger, Antoine Joux, Pierre-Alain Fouque

Publication date: 22 March 2012

Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/jmc.2011.012

zbMATH Keywords

Gröbner basescryptanalysismultivariate cryptographyweak keysHFE

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Related Items (1)

An improved signature model of multivariate polynomial public key cryptosystem against key recovery attack

Uses Software

• FGb
• Magma
• FLASH

Cites Work

• Functional decomposition of polynomials: the tame case
• Functional decomposition of polynomials: the wild case
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• The computational complexity of some problems of linear algebra
• The Magma algebra system. I: The user language
• Two varieties of finite automaton public key cryptosystem and digital signatures
• Planes of order \(n\) with collineation groups of order \(n^ 2\)

This page was built for publication: A family of weak keys in HFE and the corresponding practical key-recovery