Tutelles

SECRETS

Enseignements

Page Personnelle


Jacques Patarin
Jacques PATARIN
Professeur
Equipe CRYPTO
Laboratoire PRiSM
Université de Versailles Saint Quentin en Yvelines
78000 Versailles, FRANCE

UFR de Sciences - Batiment Descartes
Bureau: 309 C
Tél. : +33 (1) 3925 43 16
E-mail : jacques.patarin@prism.uvsq.fr

Activités scientifiques

Date Conférence Titre Liens
2014 FSE The Indistinguishability of the XOR of k permutations
2013 CANS Differential Attacks on Generalized Feistel Schemes
2013 CANS Zero-Knowledge with Rubik's Cubes and Non-Abelain Groups
2012 SECRYPT Analysis of some natural variants of the PKP Algorithm
2012 LATINCRYPT Zero-Knowledge for Multivariate Polynomials
2012 SAC Security Amplification for the Composition of block Ciphers: Simpler Proofs and News Results
2012 AsiaCrypt An Asymptotically Tight Security Analysis of the Iterated Even-Mansour Cipher
2012 TCC On the Public Indifferentiability and Correlation Intractability of the 6-Round Feistel Contruction
2011 Hypernet Some transfinite generalizations of Gödel's incompletness theorem
2010 LatinCrypt Generic Attacks on Misty Schemes
2010 IndoCrypt Indifferentiability beyond the birthday bound for the xor of two public permutations
2010 Tokyo Transfinite Cryptography
2010 Cryptologia I shall love you until death (Marie Antoinette to Axel von Fersen)
2010 AsiaCrypt Improved Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions
2009 Journal of Symbolic Computation QUAD: a multivariate stream cipher with provable security.
2009 AfricaCrypt Generic Attacks on Feistel Networks with internal Permutations
2008 Communication and computing t-resilient functions and the partial exposure problem
2008 Crypto The random Oracle Model and the Ideal Cipher Model are equivalent
2008 SAC The coefficient H technique
2008 SAC Building Secure Block Ciphers Attacks Assumptions
2008 ICITS A proof of security in O(2^n) for the Xor of two random permutations
2008 AfricaCrypt A proof of secutity in O(2^n) for the Benes Scheme
2008 SCC Analysis of Intermediate Field Systems
2007 AsiaCrypt Generic attacks on unbalanced Feistel Schemes with Expanding functions
2004 Luby-Rackoff: 5 Rounds are Enough for 2^{n-epsilon} Security
2003 Crypto Luby-Rackoff: 7 Rounds are Enough for 2^{n-epsilon} Security
Generic Attacks on Feistel Schemes (Eprint Version)
Generic Attacks on Feistel Schemes (Extended Version)
Design of near - optimal pseudorandom functions and pseudorandom permutations in the information - theoretic model
Random Feistel Schemes: security in m <<2^{3n/4} for >= 6 rounds
Homogeneous Permutations. Random Feistel schemes are never homogeneous
About Feistel Schemes with 6 (or more) rounds (Extended Version)