On the security of biquadratic \(C^\ast\) public-key cryptosystems and its generalizations
From MaRDI portal
Publication:2632838
DOI10.1007/s12095-018-0337-yzbMath1412.94173OpenAlexW2898020624MaRDI QIDQ2632838
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
multivariate cryptographysolving equationspost-quantum cryptographydegree of regularityfirst fall degreebiquadratic C*C*DobbertinGröbner basis attacksImai-Matsumoto
Related Items (1)
Cites Work
- First fall degree and Weil descent
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- Rank analysis of cubic multivariate cryptosystems
- Differential Properties of the HFE Cryptosystem
- Practical Key-Recovery for All Possible Parameters of SFLASH
- Asymmetric Cryptography with a Hidden Monomial
- Last Fall Degree, HFE, and Weil Descent Attacks on ECDLP
- On Polynomial Systems Arising from a Weil Descent
- Inverting HFE Systems Is Quasi-Polynomial for All Fields
- Advances in Cryptology - CRYPTO 2003
- Comparison Between XL and Gröbner Basis Algorithms
- Coding and Cryptography
- Algebraic aspects of cryptography. With an appendix on hyperelliptic curves by Alfred J. Menezes, Yi-Hong Wu, and Robert J. Zuccherato
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the security of biquadratic \(C^\ast\) public-key cryptosystems and its generalizations