HFE and BDDs: a practical attempt at cryptanalysis

MaRDI QIDQ3154867zbMATH OpenFDO

Authors Jean Francis Michon, Pierre Valarcher, Jean-Baptiste Yunès

Publication date 14 January 2005

Mathematics Subject Classification ID

Applications of graph theory (05C90) Boolean functions (06E30) Graph theory (including graph drawing) in computer science (68R10) Cryptography (94A60)

Recommendations

• Cryptanalysis of the HFE public key cryptosystem by relinearization
• An Efficient Provable Distinguisher for HFE
• The security of hidden field equations (HFE)
• Inverting HFE Is Quasipolynomial
• Advances in Cryptology - CRYPTO 2003

Cited in

(5)

• Polybori: A framework for Gröbner-basis computations with Boolean polynomials
• Cryptanalysis of Multivariate and Odd-Characteristic HFE Variants
• Cryptanalysis of the HFE public key cryptosystem by relinearization
• Cryptanalysis of HFEv and internal perturbation of HFE
• Boolean polynomials, BDDs and CRHS equations -- connecting the dots with CryptaPath

This page was built for publication: HFE and BDDs: a practical attempt at cryptanalysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3154867)