TCHo: A hardware-oriented trapdoor cipher

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4586 LNCS, Issue , 2007, Pages 184-199

  Aumasson, Jean Philippe ^a   Finiasz, Matthieu ^b   Meier, Willi ^a   Vaudenay, Serge ^c  

^a UNIVERSITY OF APPLIED SCIENCES AND ARTS NORTHWESTERN SWITZERLAND   (Switzerland)

^b ENSTA PARISTECH   (France)

^c EPFL   (Switzerland)

Author keywords

Hardware; Linear feedback shift register; Polynomial multiples; Post quantum cryptography; Public key cryptosystem

Indexed keywords

DECODING; POLYNOMIALS; QUANTUM CRYPTOGRAPHY; SECURITY OF DATA; SEMANTICS; SHIFT REGISTERS;

CYCLIC LINEAR CODES; POLYNOMIAL MULTIPLES; POST-QUANTUM CRYPTOGRAPHY; RANDOM ORACLE MODEL;

PUBLIC KEY CRYPTOGRAPHY;

EID: 38349081055     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (29)

1. Abe, M., Gennaro, R., Kurosawa, K.: Tag-KEM/DEM: A new framework for hybrid encryption. IACR ePrint archive 2005/027 (2005) Available at http://eprint.iacr.org/2005/027 Newer version in [2]
2. Abe, M., Gennaro, R., Kurosawa, K., Shoup, V.: Tag-KEM/DEM: A new framework for hybrid encryption and a new analysis of Kurosawa-Desmedt KEM. In: Cramer, R.J.F. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 128-146. Springer, Heidelberg (2005) Older version in [1]
3. Aumasson, J.-P.: On the pseudo-random generator ISAAC. IACR ePrint archive 2006/438 (2006). Available at http://eprint.iacr.org/2006/438
4. Baignères, T., Junod, P., Vaudenay, S.: How far can we go beyond linear cryptanalysis? In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol. 3329, pp. 432-450. Springer, Heidelberg (2004)
5. Bellare, M., Desai, A., Jokipii, E., Rogaway, P.: A concrete security treatment of symmetric encryption. In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS'97), p. 394. IEEE Computer Society, Los Alamitos (1997)
6. Canteaut, A., Chabaud, F.: 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 Transactions on Information Theory 44(1), 367-378 (1998)
7. Canteaut, A., Trabbia, M.: Improved fast correlation attacks using parity check equations of weight 4 and 5. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 573-588. Springer, Heidelberg (2000)
8. Cantor, D.G., Zassenhaus, H.: A new algorithm for factoring polynomials over finite fields. Mathematics of Computation 36(154), 587-592 (1981)
9. Chowdhury, S., Maitra, S.: Efficient software implementation of linear feedback shift registers. In: Pandu Rangan, C., Ding, C. (eds.) INDOCRYPT 2001. LNCS, vol. 2247, pp. 297-307. Springer, Heidelberg (2001)
10. Chowdhury, S., Maitra, S.: Efficient software implementation of LFSR and boolean function and its application in nonlinear combiner model. In: Zhou, J., Yung, M., Han, Y. (eds.) ACNS 2003. LNCS, vol. 2846, pp. 387-402. Springer, Heidelberg (2003)
11. Dai, W.: Crypto++ library, http://www.eskimo.com/~weidai/
12. Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Transactions on Information Theory 22(6), 644-654 (1976)
13. Ellis, J.H.: The possibility of secure non-secret digital encryption. GCHQ-CESG publication (1970)
14. Finiasz, M., Vaudenay, S.: When stream cipher analysis meets public-key cryptography (invited talk). In: the Proceedings of SAC 2006, Lecture Notes in Computer Science (to appear)
15. Fujisaki, E., Okamoto, T.: Secure integration of asymmetric and symmetric encryption schemes. In: Wiener, M.J. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 537-554. Springer, Heidelberg (1999)
16. Gupta, K.C., Maitra, S.: Multiples of primitive polynomials over GF(2). In: Pandu Rangan, C., Ding, C. (eds.) INDOCRYPT 2001. LNCS, vol. 2247, pp. 62-72. Springer, Heidelberg (2001)
17. Hoffstein, J., Pipher, J., Silverman, J.H.: NTRU: A ring-based public key cryptosystem. In: Buhler, J.P. (ed.) Algorithmic Number Theory. LNCS, vol. 1423, pp. 267-288. Springer, Heidelberg (1998)
18. Jambunathan, K.: On choice of connection-polynominals for LFSR-based stream ciphers. In: Roy, B., Okamoto, E. (eds.) INDOCRYPT 2000. LNCS, vol. 1977, pp. 9-18. Springer, Heidelberg (2000)
19. Jenkins Jr., R.J.: ISAAC. In: Gollmann, D. (ed.) Fast Software Encryption. LNCS, vol. 1039, pp. 41-49. Springer, Heidelberg (1996)
20. Koblitz, N.: Elliptic curve cryptosystems. Mathematics of Computation 48(177), 203-209 (1987)
21. Lee, P.J., Brickell, E.F.: An observation on the security of McEliece's public-key cryptosystem. In: Günther, C.G. (ed.) EUROCRYPT 1988. LNCS, vol. 330, pp. 275-280. Springer, Heidelberg (1988)
22. Maitra, S., Gupta, K.C., Venkateswarlu, A.: Results on multiples of primitive polynomials and their products over GF(2). Theoretical Computer Science 341(1-3), 311-343 (2005)
23. McEliece, R.J.: 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)
24. Meier, W., Staffelbach, O.: Fast correlation attacks on stream ciphers. In: Günther, C.G. (ed.) EUROCRYPT 1988. LNCS, vol. 330, pp. 301-314. Springer, Heidelberg (1988)
25. Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing 26(5), 1484-1509 (1997)
26. Shoup, V.: NTL: A library for doing number theory. http://shoup.net/ntl/
27. Vaudenay, S.: RFID privacy based on public-key cryptography (invited talk). In: Rhee, M.S., Lee, B. (eds.) ICISC 2006. LNCS, vol. 4296, pp. 1-6. Springer, Heidelberg (2006)
28. Wagner, D.: A generalized birthday problem. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 288-304. Springer, Heidelberg (2002)
29. Zhuo, L., Prasanna, V.K.: High performance linear algebra operations on reconfigurable systems. In: Gschwind, T., Aßmann, U., Nierstrasz, O. (eds.) SC 2005. LNCS, vol. 3628, Springer, Heidelberg (2005)