SYND: A fast code-based stream cipher with a security reduction

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2007, Pages 186-190

  Gaborit, Philippe ^a   Lauradoux, Cedric ^b   Sendrier, Nicolas ^b  

^a UNIVERSITY OF LIMOGES   (France)

^b INRIA ROCQUENCOURT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

INTERNATIONAL SYMPOSIUM; SECURITY REDUCTION;

COMPUTER NETWORKS; CRYPTOGRAPHY; CYBERNETICS; INFORMATION THEORY; TECHNICAL PRESENTATIONS;

CODES (SYMBOLS);

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

References (23)

1. D. Augot, M. Finiasz and N. Sendrier, A family of fast syndrome based cryptographic hash functions, In MyCrypt 2005, LNCS 3715, (2005), p. 64-83.
2. A. Barg. Complexity issues in coding theory. In V. S. Pless and W. C. Huffman, editors, Handbook of Coding theory, volume I, chapter 7, pages 649-754. North-Holland, 1998.
3. C. Berbain, H. Gilbert and J. Patarin, QUAD: A practical stream cipher with provable security. In Serge Vaudenay, editor, Advances in Cryptology - EURO CRYPT 2006, number 4004 in LNCS, pages 109-128. Springer-Verlag, 2006.
4. E. Berlekamp, R. McEliece and H. van Tilborg, On the inherent intractability of certain coding problems, IEEE Transactions on Information Theory, IT-24(3) (1978).
5. L. Blum, M. Blum and M. Shub, A simple unpredictable pseudo-random number generator, SIAM J. comput. 15(2), (1986), p. 164-383.
6. M. Blum and S. Micali, How to generate cryptographically strong sequences of pseudorandom bits, SIAM J. Comput., 15(2),(1984), p. 850-864.
7. A. Canteaut and F. Chabaud. A new algorithm for finding minimum-weight words in a linear code: application to primitive narrow-sense BCH codes of length - 511. IEEE Transactions on Information Theory, IT-44(1998), 367-378.
8. C. Chen, W. Peterson and E. Weldon, Some results on quasi-cyclic codes, Information and Control 15 (1969) pp. 407-423.
9. J.-S. Coron and A. Joux. Cryptanalysis of a provably secure cryptographic hash function. Cryptology ePrint Archive, 2004. http://eprint iacr.org/2004/013/.
10. T. Cover. Enumerative source encoding. IEEE Transactions on Information Theory, 19(l):73-77, January 1973.
11. J.-B. Fischer and J. Stern, An efficient pseudo-ra,dom generator provably as secure as syndrome decoding, EuroCrypt 1996, (1996) p.245-255.
12. P. Gaborit and G. Zémor, Asymptotic improvement of the Gilbert-Varshamov bound for linear codes, Proceedings of ISIT 2006, Seattle, USA (2006), 287-291.
13. O. Goldreich and L. Levin, Hard core predicate for any one-way function. In Proc of STOC'89, ACM press p. 25-32.
14. Y. Gurevich. Average case completeness. Journal of Computer and System Sciences, 42(3)346-398, 1991.
15. J. Hastad, R. Impagliazzo,L. Levin and M. Luby, Pseudo-random generator from one-way functions, SIAM J. Comput., 28(4), (1999), p. 1364-1396.
16. R. Impagliazzo and M. Naor, Efficient cryptographic schemes provably as secure as subset sum, J. Cryptology, 9(4), 199-216 (1999).
17. L. Levin. Average case complete problems. SIAM Journal on Computing, 15(l):285-286, 1986.
18. RJ. McEliece, "A public-key cryptosystem based on algebraic coding theory," JPL DSN Progress Report 42-44, 114-116 (1978).
19. F.J. MacWilliams, N.J.A. Sloane, The Theory of Error Correcting Codes, North-Holland (1977).
20. J. N. Pierce, Limit distributions of the minimum distance of random linear codes, IEEE Trans. Inf. theory, Vol IT-13 (1967), pp. 595-599.
21. N. Sendrier, Cryptosystèmes à clé publique bases sur les codes correcteurs d'erreurs, Mémoire d'habilitation, Inria 2002, available at: http://www-rocq.inria.fr/codes/Nicolas.Sendrier/pub.html
22. N. Sendrier. Encoding information into constant weight words. In IEEE Conference, ISTT'2005, Adelaide, Australia, September 2005.
23. D. Wagner. A generalized birthday problem. In M. Yung, editor, CRYPTO'02, number 2442 in LNCS, pages 288-303. Springer-Verlag, 2002.