On the security of biquadratic C^ public-key cryptosystems and its generalizations
From MaRDI portal
Publication:2632838
Recommendations
Cites work
- A new efficient algorithm for computing Gröbner bases (F₄)
- 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
- Asymmetric Cryptography with a Hidden Monomial
- Asymmetric cryptography with S-boxes. Is it easier than expected to design efficient asymmetric cryptosystems?
- Coding and Cryptography
- Comparison Between XL and Gröbner Basis Algorithms
- Cryptanalysis of the HFE public key cryptosystem by relinearization
- Cryptanalysis of the Matsumoto and Imai public key scheme of Eurocrypt '88
- Differential Properties of the HFE Cryptosystem
- First fall degree and Weil descent
- scientific article; zbMATH DE number 5296403 (Why is no real title available?)
- scientific article; zbMATH DE number 4070803 (Why is no real title available?)
- scientific article; zbMATH DE number 2151220 (Why is no real title available?)
- Inverting HFE systems is quasi-polynomial for all fields
- Last fall degree, HFE, and Weil descent attacks on ECDLP
- On polynomial systems arising from a Weil descent
- Practical Key-Recovery for All Possible Parameters of SFLASH
- Rank analysis of cubic multivariate cryptosystems
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)