The "coefficients H" technique

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

Volumn 5381 LNCS, Issue , 2008, Pages 328-345

  Patarin, Jacques ^a  

^a LABORATOIRE DES SCIENCES DU CLIMAT ET DE L ENVIRONNEMENT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CIPHERTEXTS; PSEUDO RANDOM; PSEUDO-RANDOM PROPERTIES;

CRYPTOGRAPHY;

EID: 70350677135     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04159-4_21     Document Type: Conference Paper

References (26)

1. Aiello, W., Venkatesan, R.: Foiling birthday attacks in length-doubling transformations. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 307-320. Springer, Heidelberg (1996)
2. Bellare, M., Desai, A., Jokipii, E., Rogaway, P.: A Concrete Security Treatment of Symmetric Encryption: Analysis of the DES Modes of Operation. A Concrete Security Treatment of Symmetric Encryption and appeared in the Proceedings of 38th Annual Symposium of Computer Science, IEEE (1997)
3. Hall Jr., M.: A Combinatorial Problem on Abelian Groups. Proceedings of the Americal Mathematical Society 3(4), 584-587 (1952)
4. Katz, J., Yung, M.: Characterization of Security Notions for Probabilistic. In: Private-Key Encription - STOC 2000 (2000)
5. Katz, J., Yung, M.: Unforgeable Encryption and Chosen-Ciphertext-Secure Modes of Operation. In: Fast Software Encryption 2000 (2000)
6. Luby, M., Rackoff, C.: How to Construct Pseudorandom Permutations from Pseudorandom Functions. SIAM J. Comput. 17(2), 373-386 (1988)
7. Maurer, U.M.: A simplified and generalized treatment of luby-rackoff pseudorandom permutation generators. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol. 658, pp. 239-255. Springer, Heidelberg (1993)
8. Maurer, U.M.: Indistinguishability of random systems. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 100-132. Springer, Heidelberg (2002)
9. Maurer, U., Pietrzak, K.: The Security of Many-Round Luby-Rackoff Pseudo-Random Permutations. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 544-561. Springer, Heidelberg (2003)
10. Naor, M., Reingold, O.: On the Construction of Pseudorandom Permutations: Luby-Rackoff Revisited. J. Cryptology 12(1), 29-66 (1999)
11. Patarin, J.: Pseudorandom Permutations based on the DES Scheme. In: Charpin, P., Cohen, G. (eds.) EUROCODE 1990. LNCS, vol. 514, pp. 193-204. Springer, Heidelberg (1991)
12. Patarin, J.: Etude de Générateurs de Permutations Basés sur les Schémas du DES. Ph. Thesis. Inria, Domaine de Voluceau, France (1991)
13. Patarin, J.: New results on pseudorandom permutation generators based on the DES scheme. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 301-312. Springer, Heidelberg (1992)
14. Patarin, J.: How to construct pseudorandom and super pseudorandom permutations from one single pseudorandom function. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol. 658, pp. 256-266. Springer, Heidelberg (1993)
15. Patarin, J.: Generic attacks on feistel schemes. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 222-238. Springer, Heidelberg (2001)
16. Patarin, J.: Luby-rackoff: 7 rounds are enough for formula image security. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 513-529. Springer, Heidelberg (2003)
17. Patarin, J.: On linear systems of equations with distinct variables and small block size. In: Won, D.H., Kim, S. (eds.) ICISC 2005. LNCS, vol. 3935, pp. 299-321. Springer, Heidelberg (2006)
18. Patarin, J.: A proof of security in O(2n)for the benes scheme. In: Vaudenay, S. (ed.) AFRICACRYPT 2008. LNCS, vol. 5023, pp. 209-220. Springer, Heidelberg (2008)
19. Patarin, J.: A proof of security in O(2n) for the xor of two random permutations. In: Safavi-Naini, R. (ed.) ICITS 2008. LNCS, vol. 5155, pp. 232-248. Springer, Heidelberg (2008)
20. Patarin, J.: Generic Attacks for the Xor of k Random Permutations (eprint) (2008)
21. Patarin, J., Nachef, V., Berbain, C.: Generic attacks on unbalanced feistel schemes with contracting functions. In: Lai, X., Chen, K. (eds.) ASIACRYPT 2006. LNCS, vol. 4284, pp. 396-411. Springer, Heidelberg (2006)
22. Patarin, J., Nachef, V., Berbain, C.: Generic attacks on unbalanced feistel schemes with expanding functions. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol. 4833, pp. 325-341. Springer, Heidelberg (2007)
23. Patarin, J., Seurin, Y.: Building Secure Block Ciphers on Generic Attacks Assumptions. In: SAC 2008 (2008)
24. Salzborn, F., Szekeres, G.: A Problem in Combinatorial Group Theory. Ars Combinatoria 7, 3-5 (1979)
25. Schneier, B., Kelsey, J.: Unbalanced Feistel Networks and Block Cipher Design. In: Gollmann, D. (ed.) FSE 1996. LNCS, vol. 1039, pp. 121-144. Springer, Heidelberg (1996)
26. Treger, J., Patarin, J.: Generic Attacks On Feistel Schemes with Internal Permutations (paper in preparation)