论文信息 - Some weak keys in McEliece public-key cryptosystem

Some weak keys in McEliece public-key cryptosystem

We show that the Goppa codes /spl Gamma/(L,g) where g is a binary polynomial constitute a recognizable family of weak keys for McEliece (1978) cryptosystem, thus inducing naturally a structural attack against the system.

N. Sendrier | P. Loidrean

[1] Enrico Bombieri,et al. On Exponential Sums in Finite Fields , 1966 .

[2] Robert J. McEliece,et al. A public key cryptosystem based on algebraic coding theory , 1978 .

[3] N. Sendrier. Finding the permutation between equivalent binary codes , 1997, Proceedings of IEEE International Symposium on Information Theory.

[4] Nicolas Sendrier,et al. On the Dimension of the Hull , 1997, SIAM J. Discret. Math..

[5] 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 .