Some weak keys in McEliece public-key cryptosystem

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 1998, Pages 382-

  Loidrean, P ^a   Sendrier, N ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

GOPPA CODES; MCELIECE; MCELIECE PUBLIC-KEY CRYPTOSYSTEM; STRUCTURAL ATTACKS; WEAK KEY;

INFORMATION THEORY;

CRYPTOGRAPHY;

EID: 0012052075     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.1998.708987     Document Type: Conference Paper

References (7)

1. E. Bombieri, Exponential Sums in Finite Fields, Am. J. Math., vol. 88, pp.71-105, 1966.
2. A. Canteaut, F. Chabaud, 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 511, IEEE Trans. Inf. Theo, vol 44-1, pp 367-378, 1998.
3. V .D Goppa, A new class of linear error-correcting codes, Probl. Peredach. Inf, vol 6, pp 24-30, 1971.
4. R.J. McEliece, A public-key cryptosystem based on algebraic coding theory, DSN Progress Report, pp. 114-116, 1978.
5. H. Niederreiter, Knapsack-type cryptosystems and algebraic coding theory, Prob. Cont. Info. Theo, vol 15. pt. 2, 1986.
6. N. Sendrier, Finding the permutation between equivalent binary codes, IEEE Conference, ISIT'97, Ulm Germany.
7. N. Sendrier, On the dimension of the hull, SIAM J. App. Math, vol 10, pp. 282-293, 1997.