Shor P W.Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer[J]. SIAM journal on computing, 1997, 26(5): 1484-1509.
[2]
Finiasz M, Vaudenay S.When stream cipher analysis meets public-key cryptography[C]//Selected Areas in Cryptography. Springer Berlin Heidelberg, 2007: 266-284.
[3]
Vaudenay S, Aumasson J P, Finiasz M, et al.TCHo: a Hardware-Oriented Trapdoor Cipher[C]//ACISP" 07: the 12th Australasian Conference on Information Security and Privacy. Springer, 2007 (LASEC-CONF-2007-053): 184-199.
[4]
Duc A, Vaudenay S.TCHo: A Code-Based Cryptosystem[C]//.Advances in Network Analysis and its Applications. Springer Berlin Heidelberg, 2013: 149-179.
[5]
El Aimani L, von zur Gathen J. Finding low weight polynomial multiples using lattices[R]. Cryptology ePrint Archive, Report2007/423(2007).
[6]
Canteaut A, Chabaud F.A New Algorithm for Finding Minimum-Weight Words in a LinearCode: Application to McEliece’s Cryptosystem and to Narrow-Sense BCH Codes of Length 511[J]. IEEE Transactions on Information Theory, 1998,44(1):367-378.
[7]
Anscomeb F J.Large - sample theory of sequential estimation. Proe[M]. Cambridge: Cambridge philos,1996.
[8]
Herrmann, M., Leander, G.A Practical Key Recovery Attack on Basic TCHo[C]// Public Key Cryptography, Lecture Notes in Computer Science, Springer, 2009,5443:411-424.
[9]
Fujisaki E, Okamoto T.Secure integration of asymmetric and symmetric encryption schemes[C]//Advances in Cryptology—CRYPTO'99. Springer Berlin Heidelberg, 1999: 537-554.