Information-Set Decoding for Linear Codes over Fq
暂无分享,去创建一个
[1] Niklaus Wirth,et al. Advances in Cryptology — EUROCRYPT ’88 , 2000, Lecture Notes in Computer Science.
[2] Raphael Overbeck,et al. Code-based cryptography , 2009 .
[3] Elwyn R. Berlekamp,et al. On the inherent intractability of certain coding problems (Corresp.) , 1978, IEEE Trans. Inf. Theory.
[4] Jeffrey S. Leon,et al. A probabilistic algorithm for computing minimum weights of large error-correcting codes , 1988, IEEE Trans. Inf. Theory.
[5] Oscar Moreno,et al. McEliece Public Key Cryptosystems Using Algebraic-Geometric Codes , 1996, Des. Codes Cryptogr..
[6] Thierry P. Berger,et al. Reducing Key Length of the McEliece Cryptosystem , 2009, AFRICACRYPT.
[7] Tanja Lange,et al. Attacking and defending the McEliece cryptosystem , 2008, IACR Cryptol. ePrint Arch..
[8] Thierry P. Berger,et al. How to Mask the Structure of Codes for a Cryptographic Use , 2005, Des. Codes Cryptogr..
[9] Ernest F. Brickell,et al. An Observation on the Security of McEliece's Public-Key Cryptosystem , 1988, EUROCRYPT.
[10] Elwyn R. Berlekamp,et al. Algebraic coding theory , 1984, McGraw-Hill series in systems science.
[11] Daniel J. Bernstein,et al. Explicit bounds for generic decoding algorithms for code-based cryptography , 2009 .
[12] Todd A. Brun,et al. Quantum Computing , 2011, Computer Science, The Hardware, Software and Heart of It.
[13] Eugene Prange,et al. The use of information sets in decoding cyclic codes , 1962, IRE Trans. Inf. Theory.
[14] Oscar Moreno,et al. McEliece public key cryptosystems using algebraic-geometric codes , 1996 .
[15] P. Godlewski,et al. Coding Theory and Applications , 1986, Lecture Notes in Computer Science.
[16] Paulo S. L. M. Barreto,et al. Compact McEliece Keys from Goppa Codes , 2009, IACR Cryptol. ePrint Arch..
[17] Bart Preneel. Progress in Cryptology - AFRICACRYPT 2009, Second International Conference on Cryptology in Africa, Gammarth, Tunisia, June 21-25, 2009. Proceedings , 2009, AFRICACRYPT.
[18] Robert J. McEliece,et al. A public key cryptosystem based on algebraic coding theory , 1978 .
[19] Matthieu Finiasz,et al. Security Bounds for the Design of Code-Based Cryptosystems , 2009, ASIACRYPT.
[20] Nicholas J. Patterson,et al. The algebraic decoding of Goppa codes , 1975, IEEE Trans. Inf. Theory.
[21] Aggelos Kiayias,et al. Polynomial Reconstruction Based Cryptography , 2001, Selected Areas in Cryptography.
[22] Anne Canteaut,et al. A New Algorithm for Finding Minimum-Weight Words in a Linear Code: Application to McEliece’s Cryptosystem and to Narrow-Sense BCH Codes of Length , 1998 .
[23] Jacques Stern,et al. A method for finding codewords of small weight , 1989, Coding Theory and Applications.
[24] Benny Pinkas,et al. Secure Two-Party Computation is Practical , 2009, IACR Cryptol. ePrint Arch..