[1]Shor P. Polynomial-time Algorithms for Pime Factorization and Discrete Logarithms on A Quantum Computer [J]. SIAM Journal on Computing, 1997, 26(5): 1484-1509.
[2]Garay M, Johnson D. Computers and Intractability —a Guide to the Theory of NP-Completeness [M]. San Francisco: W H Freeman and Company, 1979: 250-251.
[3]Patarin J, Goubin L. Trapdoor One-way Permutations and Multivariate Polynomials [C]//International Conference on Information Security and Cryptology 1997, LNCS: 1334. Berlin: Springer, 1999: 356-368.
[4]European IST. NESSIE Project [EB/OL]. [2000-12-12]. http://www.cryptonessie.org.
[5]Akkar M, Courtois N T, Duteuil R, et al. A Fast and Secure Implementation of Sflash [C]//PKC 2003, LNCS: 2567. Berlin: Springer, 2003: 267-278.
[6]韦宝典, 刘景伟, 王新梅. NESSIE分组密码及其安全性分析[J]. 西安电子科技大学学报, 2004, 31(3): 377-382.
Wei Baodian, Liu Jingwei, Wang Xinmei. The NESSIE Block Ciphers and Their Security [J]. Journal of Xidian University, 2004, 31(3): 377-382.
[7]Kipnis A, Shamir A. Cryptanalysis of the Oil and Vinegar Signature Scheme [C]//Advances in Cryptology—CRYPTO 1998, LNCS: 1462. Berlin: Springer, 1998: 257-267.
[8]Wolf C, Preneel B. Equivalent Keys in HFE, C*, and Variations [C]//Proceedings of Mycrypt 2005, LNCS: 3725. Berlin: Springer, 2005: 33-49.
[9]Wolf C, Preneel B. Superfluous Keys in Multivariate Quadratic Asymmetric Systems [C]//PKC 2005, LNCS 3386. Berlin: Springer, 2005: 275-287.
[10]Kasahara M, Sakai R. A Construction of Public Key Cryptosystem for Realizing Ciphertext of Size 100 Bit and Digital Signature Scheme [J]. IEICE Trans on Fundamentals, 2004: E87-A(1): 102-109. |