[1] |
RIVEST R L , SHAMIR A , ADLEMAN L . A method for obtaining digital signatures and public-key cryptosystems[J]. Communications of the ACM, 21(2): 120-126: 1978
|
[2] |
SHOR P W , . Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer[C]// Quantum Entanglement and Quantum Information-Proceedings of CCAST. 1999: 303-332.
|
[3] |
BERNSTEIN D J , BUCHMANN J , DAHMEN E . Post quantum cryptography[M]. Berlin Heidelberg: Springer, 2010.
|
[4] |
BOGDANOV A , EISENBARTH T , RUPP A ,et al. Time-area optimized publickey engines:MQ-cryptosystems as replacement for elliptic curves?[C]// Cryptographic Hardware and Embedded Systems–CHES 2008. 2008: 45-61.
|
[5] |
DING J , SCHMIDT D . Rainbow,a new multivariable polynomial signature scheme[C]// International Conference on Applied Cryptography and Network Security. 2005: 164-175.
|
[6] |
CHENG T , DIENE A , TANG S ,et al. Simple matrix scheme for encryption[C]// International Workshop on Post-Quantum Cryptography. 2013: 231-242.
|
[7] |
DING J , PETZOLDT A , WANG L C . The cubic simple matrix encryption scheme[C]// Post-Quantum Cryptography. 2014: 76-87.
|
[8] |
KIPNIS A , SHAMIR A . Cryptanalysis of the HFE public key cryptosystem[C]// Advances in Cryptology—CRYPTO’99. 1999: 19-30.
|
[9] |
SAKUMOTO K , SHIRAI T , HIWATARI H . Public-key identification schemes based on multivariate quadratic polynomials[J]. Technical Report of Ieice Isec, 2011,111: 706-723.
|
[10] |
PATARIN J , . Asymmetric cryptography with a hidden monomial[C]// Advances in Cryptology—CRYPTO ’96. 1996: 45-60.
|
[11] |
DING J , GOWER J E , SCHMIDT D S . Multivariate public key cryptosystems[M]. US : Springer US, 2006.
|
[12] |
丁斗博 . 多变量公钥密码中TTS方案的分析与改进[D]. 西安:西安电子科技大学, 2013.
|
|
DING D B . Analysis and improvement on the multivariate quadrat-ic TTS scheme[D]. Xi’an:Xidian University, 2013.
|
[13] |
GOUBIN L , COURTOIS N . Cryptanalysis of the TTM Cryptosystem[C]// International Conference on the Theory and Application of Cryptology and Information Security. 2000: 44-57.
|
[14] |
COPPERSMITH D , STERN J , VAUDENAY S . Attacks on the birational permutation signature schemes[C]// Advances in Cryptology—CRYPTO’ 93. 1993: 435-443.
|
[15] |
DING J , SCHMIDT D . Rainbow,a new multivariable polynomial signature scheme[C]// Applied Cryptography and Network Security. 2005: 164-175.
|
[16] |
COURTOIS N , KLIMOV A , PATARIN J ,et al. Efficient algorithms for solving overdefined systems of multivariate polynomial equations[C]// Advances in Cryptology—EUROCRYPT 2000. 2000: 392-407.
|
[17] |
FAUGERE J C , . A new efficient algorithm for computing Gr?bner bases without reduction to zero (F5)[C]// The 2002 International Symposium on Symbolic and Algebraic Computation. 2002: 75-83.
|
[18] |
FAUGERE J C . A new efficient algorithm for computing Grobner bases (F4)[J]. Journal of Pure and Applied Algebra, 1999,139: 61-88.
|
[19] |
DING J , BUCHMANN J . Solving degree and degree of regularity for polynomial systems over a finite fields[C]// The First International Conference on Symbolic Computation and Cryptography (SCC 2008). 2008.
|
[20] |
MOHAMED M S E , CABARCAS D , DING J ,et al. MXL 3:an efficient algorithm for computing gr?bner bases of zero- dimensional ideals[C]// International Conference on Information Security and Cryptology. 2009: 87-100.
|