Author:
Courtois Nicolas,Klimov Alexander,Patarin Jacques,Shamir Adi
Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. Iyad A. Ajwa, Zhuojun Liu, and Paul S. Wang: “Grobner Bases Algorithm”, ICM Technical Reports, February 1995. See http://symbolicnet.mcs.kent.edu/icm/reports/index1995.html .
2. Don Coppersmith: “Finding a small root of a univariate modular equation”; Proceedings of Eurocrypt’96, Springer-Verlag, pp.155–165.
3. Nicolas Courtois “The security of HFE”, to be published.
4. Nicolas Courtois: The HFE cryptosystem web page. See http://www.univ-tln.fr/~courtois/hfe.html
5. Jean-Charles Faugère: “A new efficient algorithm for computing Gröbner bases (F4).” Journal of Pure and Applied Algebra 139 (1999) pp. 61–88. See http://www.elsevier.com/locate/jpaa
Cited by
303 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. SoK: CryptographicEstimators -- a Software Library for Cryptographic Hardness Estimation;Proceedings of the 19th ACM Asia Conference on Computer and Communications Security;2024-07
2. Counter-light Memory Encryption;2024 ACM/IEEE 51st Annual International Symposium on Computer Architecture (ISCA);2024-06-29
3. Universal Gaussian elimination hardware for cryptographic purposes;Journal of Cryptographic Engineering;2024-05-22
4. Solving systems of algebraic equations over finite commutative rings and applications;Applicable Algebra in Engineering, Communication and Computing;2024-04-24
5. Preliminary Cryptanalysis of the Biscuit Signature Scheme;IACR Communications in Cryptology;2024-04-09