Jacques Patarin

Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

? Tutorial for this page

Demo Data from SIGIR 2026 / reviewers in the wild / expert

dblp:00/4060 · DBLP profile ↗

← Back

42ranked-venue papers

22as first author

3since 2021 · last 2024

—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 41 · 22 first-author · 3 since 2021Theory of computation · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security

24 papers

Cryptographic primitives and cryptanalysis · 99% Hardware security and side channels · 1%

Topics — the 28 heaviest of 29, each with the papers that count most for it

Topic	Weight	Papers	Last	Evidence papers
Cryptographic primitives and cryptanalysis cryptographic proofs	0.7	1	2023	Proof of Mirror Theory for a Wide Range of $\xi _{\max }$ · EUROCRYPT (4) 2023
Cryptographic primitives and cryptanalysis mirror theory	0.7	1	2023	Proof of Mirror Theory for a Wide Range of $\xi _{\max }$ · EUROCRYPT (4) 2023
Cryptographic primitives and cryptanalysis block cipher	0.5	3	2016	How to Build an Ideal Cipher: The Indifferentiability of the Feistel Construction · J. Cryptol. 2016 An Asymptotically Tight Security Analysis of the Iterated Even-Mansour Cipher · ASIACRYPT 2012 Improved Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions · ASIACRYPT 2010
Cryptographic primitives and cryptanalysis › block cipher feistel network	0.3	3	2016	How to Build an Ideal Cipher: The Indifferentiability of the Feistel Construction · J. Cryptol. 2016 Security of Random Feistel Schemes with 5 or More Rounds · CRYPTO 2004 Luby-Rackoff: 7 Rounds Are Enough for 2n(1-epsilon)Security · CRYPTO 2003
Cryptographic primitives and cryptanalysis › block cipher ideal cipher	0.2	1	2016	How to Build an Ideal Cipher: The Indifferentiability of the Feistel Construction · J. Cryptol. 2016
Cryptographic primitives and cryptanalysis › cryptographic foundations › cryptographic models indifferentiability	0.2	1	2016	How to Build an Ideal Cipher: The Indifferentiability of the Feistel Construction · J. Cryptol. 2016
Cryptographic primitives and cryptanalysis block cipher cryptanalysis	0.2	3	2007	Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions · ASIACRYPT 2007 Generic Attacks on Unbalanced Feistel Schemes with Contracting Functions · ASIACRYPT 2006 Generic Attacks on Feistel Schemes · ASIACRYPT 2001
Cryptographic primitives and cryptanalysis › block cipher cryptanalysis feistel scheme attacks	0.2	3	2007	Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions · ASIACRYPT 2007 Generic Attacks on Unbalanced Feistel Schemes with Contracting Functions · ASIACRYPT 2006 Generic Attacks on Feistel Schemes · ASIACRYPT 2001
Cryptographic primitives and cryptanalysis › block cipher › key-alternating ciphers even-mansour cipher	0.1	1	2012	An Asymptotically Tight Security Analysis of the Iterated Even-Mansour Cipher · ASIACRYPT 2012
Cryptographic primitives and cryptanalysis › pseudorandomness pseudorandom permutations	0.1	4	2004	Security of Random Feistel Schemes with 5 or More Rounds · CRYPTO 2004 Improved Security Bounds for Pseudorandom Permutations · CCS 1997 Luby-Rackoff: 7 Rounds Are Enough for 2n(1-epsilon)Security · CRYPTO 2003
Cryptographic primitives and cryptanalysis › cryptographic foundations cryptographic models	0.1	1	2008	The Random Oracle Model and the Ideal Cipher Model Are Equivalent · CRYPTO 2008
Cryptographic primitives and cryptanalysis random oracle model	0.1	1	2008	The Random Oracle Model and the Ideal Cipher Model Are Equivalent · CRYPTO 2008
Cryptographic primitives and cryptanalysis stream cipher	0.1	1	2006	QUAD: A Practical Stream Cipher with Provable Security · EUROCRYPT 2006
Cryptographic primitives and cryptanalysis security analysis	0.0	1	2012	An Asymptotically Tight Security Analysis of the Iterated Even-Mansour Cipher · ASIACRYPT 2012
Cryptographic primitives and cryptanalysis › provable security tight security	0.0	1	2012	An Asymptotically Tight Security Analysis of the Iterated Even-Mansour Cipher · ASIACRYPT 2012
Cryptographic primitives and cryptanalysis pseudorandom functions	0.0	1	2003	Luby-Rackoff: 7 Rounds Are Enough for 2n(1-epsilon)Security · CRYPTO 2003
Cryptographic primitives and cryptanalysis › post-quantum cryptography multivariate cryptography	0.0	2	1998	Improved Algorithms for Isomorphisms of Polynomials · EUROCRYPT 1998 Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms · EUROCRYPT 1996
Cryptographic primitives and cryptanalysis › public-key cryptography public-key cryptanalysis	0.0	2	1998	C*-+ and HM: Variations Around Two Schemes of T. Matsumoto and H. Imai · ASIACRYPT 1998 Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt'88 · CRYPTO 1995
Hardware security and side channels › side-channel attack › power analysis differential power analysis	0.0	1	1999	DES and Differential Power Analysis (The "Duplication" Method) · CHES 1999
Cryptographic primitives and cryptanalysis › public-key cryptography digital signatures	0.0	1	1999	Unbalanced Oil and Vinegar Signature Schemes · EUROCRYPT 1999
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures › post-quantum signatures multivariate signature schemes	0.0	1	1999	Unbalanced Oil and Vinegar Signature Schemes · EUROCRYPT 1999
Hardware security and side channels side-channel attack	0.0	1	1999	DES and Differential Power Analysis (The "Duplication" Method) · CHES 1999
Cryptographic primitives and cryptanalysis › post-quantum cryptography › multivariate cryptography HFE	0.0	1	1996	Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms · EUROCRYPT 1996
Cryptographic primitives and cryptanalysis public-key cryptography	0.0	1	1996	Asymmetric Cryptography with a Hidden Monomial · CRYPTO 1996
Cryptographic primitives and cryptanalysis › public-key cryptography RSA	0.0	1	1996	Low-Exponent RSA with Related Messages · EUROCRYPT 1996
Cryptographic primitives and cryptanalysis hash function cryptanalysis	0.0	1	1994	Collisions and Inversions for Damgård's Whole Hash Function · ASIACRYPT 1994
Cryptographic primitives and cryptanalysis › cryptographic assumptions permuted kernel problem	0.0	1	1993	Improved Algorithms for the Permuted Kernel Problem · CRYPTO 1993
Cryptographic primitives and cryptanalysis › post-quantum cryptography › multivariate cryptography unbalanced oil and vinegar	0.0	1	1999	Unbalanced Oil and Vinegar Signature Schemes · EUROCRYPT 1999

Methods — techniques the papers use, named apart from their topics

random oracle model · 0.1ideal cipher model · 0.1linearization · 0.0gröbner basis · 0.0XL algorithm · 0.0duplication method · 0.0differential power analysis · 0.0combinatorial analysis · 0.0

Year	Publication	Venue	Position
2024	State of the Art of HFE Variants - Is It Possible to Repair HFE with Appropriate Modifiers? Benoit Cogliati, Gilles Macario-Rat, Jacques Patarin, Pierre Varjabedian	PQCrypto (2)	3
2024	Classical and Quantum Generic Attacks on 6-Round Feistel Schemes Maya Chartouny, Benoit Cogliati, Jacques Patarin	SAC (2)	3
2023	Proof of Mirror Theory for a Wide Range of $\xi _{\max }$ Benoit Cogliati, Avijit Dutta, Mridul Nandi, Jacques Patarin, Abishanka Saha	EUROCRYPT (4)	4
2016	How to Build an Ideal Cipher: The Indifferentiability of the Feistel Construction Jean-Sébastien Coron, Thomas Holenstein, Robin Künzler, Jacques Patarin, Yannick Seurin, Stefano Tessaro	J. Cryptol.	4
2014	The Indistinguishability of the XOR of k Permutations Benoit Cogliati, Rodolphe Lampe, Jacques Patarin	FSE	3
2014	Security Amplification for the Composition of Block Ciphers: Simpler Proofs and New Results Benoit Cogliati, Jacques Patarin, Yannick Seurin	Selected Areas in Cryptography	2
2013	Generic Attacks for the Xor of k Random Permutations Jacques Patarin	ACNS	1
2013	Differential Attacks on Generalized Feistel Schemes Valérie Nachef, Emmanuel Volte, Jacques Patarin	CANS	3
2013	Zero Knowledge with Rubik's Cubes and Non-abelian Groups Emmanuel Volte, Jacques Patarin, Valérie Nachef	CANS	2
2012	An Asymptotically Tight Security Analysis of the Iterated Even-Mansour Cipher Rodolphe Lampe, Jacques Patarin, Yannick Seurin	ASIACRYPT	2
2012	Analysis of Some Natural Variants of the PKP Algorithm Rodolphe Lampe, Jacques Patarin	SECRYPT	2
2012	On the Public Indifferentiability and Correlation Intractability of the 6-Round Feistel Construction Avradip Mandal, Jacques Patarin, Yannick Seurin	TCC	2
2010	Improved Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions Emmanuel Volte, Valérie Nachef, Jacques Patarin	ASIACRYPT	3
2009	QUAD: A multivariate stream cipher with provable security Côme Berbain, Henri Gilbert, Jacques Patarin	J. Symb. Comput.	3
2008	The Random Oracle Model and the Ideal Cipher Model Are Equivalent Jean-Sébastien Coron, Jacques Patarin, Yannick Seurin	CRYPTO	2
2007	Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions Jacques Patarin, Valérie Nachef, Côme Berbain	ASIACRYPT	1
2006	Generic Attacks on Unbalanced Feistel Schemes with Contracting Functions Jacques Patarin, Valérie Nachef, Côme Berbain	ASIACRYPT	1
2006	QUAD: A Practical Stream Cipher with Provable Security Côme Berbain, Henri Gilbert, Jacques Patarin	EUROCRYPT	3
2004	Security of Random Feistel Schemes with 5 or More Rounds Jacques Patarin	CRYPTO	1
2003	Luby-Rackoff: 7 Rounds Are Enough for 2n(1-epsilon)Security Jacques Patarin	CRYPTO	1
2003	About the XL Algorithm over GF(2) Nicolas T. Courtois, Jacques Patarin	CT-RSA	2
2001	Generic Attacks on Feistel Schemes Jacques Patarin	ASIACRYPT	1
2001	QUARTZ, 128-Bit Long Digital Signatures Jacques Patarin, Nicolas T. Courtois, Louis Goubin	CT-RSA	1
2001	FLASH, a Fast Multivariate Signature Algorithm Jacques Patarin, Nicolas T. Courtois, Louis Goubin	CT-RSA	1
2000	Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations Nicolas T. Courtois, Alexander Klimov, Jacques Patarin, Adi Shamir	EUROCRYPT	3
2000	Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt'98 Jacques Patarin	Des. Codes Cryptogr.	1
1999	DES and Differential Power Analysis (The "Duplication" Method) Louis Goubin, Jacques Patarin	CHES	2
1999	Unbalanced Oil and Vinegar Signature Schemes Aviad Kipnis, Jacques Patarin, Louis Goubin	EUROCRYPT	2
1998	C*-+ and HM: Variations Around Two Schemes of T. Matsumoto and H. Imai Jacques Patarin, Louis Goubin, Nicolas T. Courtois	ASIACRYPT	1
1998	Improved Algorithms for Isomorphisms of Polynomials Jacques Patarin, Louis Goubin, Nicolas T. Courtois	EUROCRYPT	1
1998	About Feistel Schemes with Six (or More) Rounds Jacques Patarin	FSE	1
1997	Improved Security Bounds for Pseudorandom Permutations abstract Article Improved security bounds for pseudorandom permutations Share on Author: Jacques Patarin CP8 Transac, 68 route de Versailles - BP 45, 78431 Louveciennes Cedex - France CP8 Transac, 68 route de Versailles - BP 45, 78431 Louveciennes Cedex - FranceView Profile Authors Info & Claims CCS '97: Proceedings of the 4th ACM conference on Computer and communications securityApril 1997 Pages 142–150https://doi.org/10.1145/266420.266452Online:01 April 1997Publication History 25citation429DownloadsMetricsTotal Citations25Total Downloads429Last 12 Months6Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access Jacques Patarin	CCS	1
1997	Trapdoor one-way permutations and multivariate polynominals Jacques Patarin, Louis Goubin	ICICS	1
1997	Asymmetric cryptography with S-Boxes Jacques Patarin, Louis Goubin	ICICS	1
1996	Asymmetric Cryptography with a Hidden Monomial Jacques Patarin	CRYPTO	1
1996	Low-Exponent RSA with Related Messages Don Coppersmith, Matthew K. Franklin, Jacques Patarin, Michael K. Reiter	EUROCRYPT	3
1996	Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms Jacques Patarin	EUROCRYPT	1
1995	Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt'88 Jacques Patarin	CRYPTO	1
1994	Collisions and Inversions for Damgård's Whole Hash Function Jacques Patarin	ASIACRYPT	1
1993	Improved Algorithms for the Permuted Kernel Problem Jacques Patarin, Pascal Chauvaud	CRYPTO	1
1991	New Results on Pseudorandom Permutation Generators Based on the DES Scheme Jacques Patarin	CRYPTO	1
1990	Pseudorandom Permutations Based on the D.E.S. Scheme Jacques Patarin	ESORICS	1