Two NP-complete problems in coding theory with an application in code based cryptography

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2006, Pages 1733-1737

  Wieschebrink, Christian ^a  

^a Federal Office for Information Security   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CODING THEORY; SECURE KEY PARAMETERS; SIDELNIKOVSHESTAKOV ATTACK;

COMPUTATIONAL COMPLEXITY; COMPUTER CRIME; INTRUSION DETECTION; PARAMETER ESTIMATION;

CRYPTOGRAPHY;

EID: 39049099966     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2006.261651     Document Type: Conference Paper

References (12)

1. R. McEliece, "A public-key cryptosystem based on algebraic coding theory," DSN Progress Report, Jet Prop. Lab., California Inst. Tech., vol. 42-44, pp. 114-116, 1978.
2. N. Niederreiter, "Knapsack-type cryptosystems and algebraic coding theory," Problems of Control and Information Theory, vol. 15, pp. 159-166, 1986.
3. E. Berlekamp, R. McEliece, and H. van Tilborg, "On the inherent intractability of certain coding problems," IEEE Transactions on Information Theory, vol. 24, no. 3, pp. 384-386, 1978.
4. A. Canteaut and F. Chabaud, "A new algorithm for finding minimumweight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511," IEEE Transactions on Information Theory, vol. 44, no. 1, pp. 367-378, 1988.
5. E. Gabidulin, "Public-key cryptosystems based on linear codes," 1995. [Online], Available: http://citeseer.ist.psu.edu/gabidulin95publickey. html
6. V. Sidelnikov and S. Shestakov, "On insecurity of cryptosystems based on generalized Reed-Solomon codes," Discrete Math. Appl., vol. 2, no. 4, pp. 439-444, 1992.
7. R. Overbeck, "A new structural attack for GPT and variants," in Mycrypt 2005, ser. Lecture Notes in Computer Science, no. 3715. SpringerVerlag, 2005.
8. M. Garey and D. Johnson, Computers and Intractability. A Guide to the Theory of NP-Compleleness. W.H. Freeman and Company, 1979.
9. R. Deng, Y. Li, and X. Wang, "On the equivalence of McEliece's and Niederreiter's public-key cryptosystems," IEEE Transactions on Information Theory, vol. 40, no. 1, pp. 271-273, 1994.
10. E. Brickell and J. Lee, "An observation on the security of McEliece's public-key cryptosystem," in EUROCRYPT '88, ser. Lecture Notes in Computer Science, no. 330. Springer-Verlag, 1988, pp. 275-280.
11. F. MacWilliams and N. Sloane, The Theory of Error-Correcting Codes. North Holland, 1997.
12. N. Tomforde, "Eine Sicherheitsanalyse des McEliece Kryptosystems," diploma thesis, University of Greifswald, Federal Office for Information Security (BSI), 2004.