On the security of biquadratic C^ public-key cryptosystems and its generalizations
From MaRDI portal
Publication:2632838
DOI10.1007/S12095-018-0337-YzbMATH Open1412.94173OpenAlexW2898020624MaRDI QIDQ2632838FDOQ2632838
Authors: Patrick Felke
Publication date: 15 May 2019
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-018-0337-y
Recommendations
solving equationsmultivariate cryptographypost-quantum cryptographydegree of regularityfirst fall degreebiquadratic C*C*DobbertinImai-MatsumotoGröbner basis attacks
Cites Work
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Advances in Cryptology - CRYPTO 2003
- Algebraic aspects of cryptography. With an appendix on hyperelliptic curves by Alfred J. Menezes, Yi-Hong Wu, and Robert J. Zuccherato
- Title not available (Why is that?)
- Title not available (Why is that?)
- Inverting HFE systems is quasi-polynomial for all fields
- Practical Key-Recovery for All Possible Parameters of SFLASH
- First fall degree and Weil descent
- On polynomial systems arising from a Weil descent
- Comparison Between XL and Gröbner Basis Algorithms
- Last fall degree, HFE, and Weil descent attacks on ECDLP
- Rank analysis of cubic multivariate cryptosystems
- Differential Properties of the HFE Cryptosystem
- Asymmetric Cryptography with a Hidden Monomial
- Coding and Cryptography
Cited In (6)
This page was built for publication: On the security of biquadratic \(C^\ast\) public-key cryptosystems and its generalizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2632838)