Cryptography Reference
In-Depth Information
14. Finiasz, M., Sendrier, N.: Security Bounds for the Design of Code-Based Cryp-
tosystems. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 88-105.
Springer, Heidelberg (2009)
15. Fischer, J.B., Stern, J.: An E
cient Pseudo-Random Generator Provably as Se-
cure as Syndrome Decoding. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS,
vol. 1070, pp. 245-255. Springer, Heidelberg (1996)
16. Gaborit, P., Girault, M.: Lightweight code-based identification and signature. In:
IEEE Conference, ISIT 2007, pp. 191-195. IEEE, Nice (2007)
17. Gaborit, P., Laudaroux, C., Sendrier, N.: Synd: a very fast code-based stream
cipher with a security reduction. In: IEEE Conference, ISIT 2007, pp. 186-190.
IEEE, Nice (2007)
18. Johansson, T., Jonsson, F.: On the complexity of some cryptographic problems
based on the general decoding problem. IEEE-IT 48(10), 2669-2678 (2002)
19. Lee, P.J., Brickell, E.F.: An Observation on the Security of McEliece's Public-Key
Cryptosystem. In: Gunther, C.G. (ed.) EUROCRYPT 1988. LNCS, vol. 330, pp.
275-280. Springer, Heidelberg (1988)
20. Leon, J.: A probabilistic algorithm for computing minimum weights of large error-
correcting codes. IEEE Trans. on Information Theory 34(5), 1354-1359 (1988)
21. McEliece, R.: A public-key cryptosystem based on algebraic coding theory. DSN
Prog. Rep., Jet Prop. Lab., California Inst. Technol., Pasadena, CA pp. 114-116
(January 1978)
22. Niederreiter, H.: Knapsack-type cryptosystems and algebraic coding theory. Prob.
Contr. Inform. Theory 15(2), 157-166 (1986)
23. Overbeck, R., Sendrier, N.: Code-based cryptography. In: Bernstein, D., Buch-
mann, J., Dahmen, E. (eds.) Post-Quantum Cryptography, pp. 95-145. Springer,
Heidelberg (2009)
24. Peters, C.: Curves, Codes, and Cryptography. Ph.D. thesis, Technische Universiteit
Eindhoven (2011)
25. Prange, E.: The use of information sets in decoding cyclic codes. IRE Transac-
tions IT-8, S5-S9 (1962)
26. Saarinen, M.J.: Linearization Attacks against Syndrome Based Hashes. In: Sri-
nathan, K., Rangan, C.P., Yung, M. (eds.) INDOCRYPT 2007. LNCS, vol. 4859,
pp. 1-9. Springer, Heidelberg (2007)
27. Stern, J.: A Method for Finding Codewords of Small Weight. In: Wolfmann, J.,
Cohen, G. (eds.) Coding Theory 1988. LNCS, vol. 388, pp. 106-113. Springer,
Heidelberg (1989)
28. Stern, J.: A New Identification Scheme Based on Syndrome Decoding. In: Stinson,
D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 13-21. Springer, Heidelberg (1994)
29. Veron, P.: Improved identification schemes based on error-correcting codes.
AAECC 8(1), 57-69 (1997)
30. Wagner, D.: A Generalized Birthday Problem. In: Yung, M. (ed.) CRYPTO 2002.
LNCS, vol. 2442, pp. 288-303. Springer, Heidelberg (2002)
