Public_Key Cryptosystems Based on Linear Codes
暂无分享,去创建一个
[1] Ernst M. Gabidulin,et al. Ideals over a Non-Commutative Ring and thier Applications in Cryptology , 1991, EUROCRYPT.
[2] Henk Meijer,et al. Security-related comments regarding McEliece's public-key cryptosystem , 1989, IEEE Trans. Inf. Theory.
[3] Martin E. Hellman,et al. Hiding information and signatures in trapdoor knapsacks , 1978, IEEE Trans. Inf. Theory.
[4] Elwyn R. Berlekamp,et al. Algebraic coding theory , 1984, McGraw-Hill series in systems science.
[5] J. K. Gibson,et al. Equivalent Goppa Codes and Trapdoors to McEliece's Public Key Cryptosystem , 1991, EUROCRYPT.
[6] Adi Shamir,et al. A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.
[7] Robert J. McEliece,et al. A public key cryptosystem based on algebraic coding theory , 1978 .
[8] Daniel Lazard,et al. Resolution des Systemes d'Equations Algebriques , 1981, Theor. Comput. Sci..
[9] O. Antoine,et al. Theory of Error-correcting Codes , 2022 .
[10] J. K. Gibson,et al. Severely denting the Gabidulin version of the McEliece Public Key Cryptosystem , 1995, Des. Codes Cryptogr..
[11] Dilip V. Sarwate,et al. On the complexity of decoding goppa codes , 1977 .
[12] Nicholas J. Patterson,et al. The algebraic decoding of Goppa codes , 1975, IEEE Trans. Inf. Theory.
[13] V. Sidelnikov,et al. On insecurity of cryptosystems based on generalized Reed-Solomon codes , 1992 .