Jacques Patarin

6.1k total citations
12 papers, 61 citations indexed

About

Jacques Patarin is a scholar working on Artificial Intelligence, Computer Vision and Pattern Recognition and Information Systems. According to data from OpenAlex, Jacques Patarin has authored 12 papers receiving a total of 61 indexed citations (citations by other indexed papers that have themselves been cited), including 10 papers in Artificial Intelligence, 4 papers in Computer Vision and Pattern Recognition and 3 papers in Information Systems. Recurrent topics in Jacques Patarin's work include Cryptographic Implementations and Security (8 papers), Coding theory and cryptography (7 papers) and Cryptography and Data Security (4 papers). Jacques Patarin is often cited by papers focused on Cryptographic Implementations and Security (8 papers), Coding theory and cryptography (7 papers) and Cryptography and Data Security (4 papers). Jacques Patarin collaborates with scholars based in France, Switzerland and United States. Jacques Patarin's co-authors include Henri Gilbert, Côme Berbain, Stefano Tessaro, Yannick Seurin, Thomas Holenstein, Jean-Sébastien Coron, Rodolphe Lampe, Olivier Billet and Aline Gouget and has published in prestigious journals such as Journal of Cryptology, Designs Codes and Cryptography and Journal of Symbolic Computation.

In The Last Decade

Jacques Patarin

12 papers receiving 57 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Jacques Patarin France	5	56	25	14	11	10	12	61
Simona Samardjiska Netherlands	5	78 1.4×	19 0.8×	13 0.9×	8 0.7×	15 1.5×	10	93
Jorge Nakahara Belgium	5	67 1.2×	39 1.6×	18 1.3×	5 0.5×	7 0.7×	11	74
Paul Stankovski Sweden	6	60 1.1×	19 0.8×	13 0.9×	7 0.6×	10 1.0×	18	68
Daniel Apon United States	4	70 1.3×	13 0.5×	12 0.9×	8 0.7×	11 1.1×	7	80
Valentin Suder France	5	69 1.2×	32 1.3×	27 1.9×	7 0.6×	9 0.9×	8	72
Yan Zong Ding United States	3	54 1.0×	31 1.2×	26 1.9×	4 0.4×	15 1.5×	5	66
Itai Dinur Israel	6	49 0.9×	29 1.2×	6 0.4×	10 0.9×	4 0.4×	17	63
Alan Szepieniec Belgium	2	54 1.0×	12 0.5×	12 0.9×	7 0.6×	4 0.4×	4	62
Xavier Bonnetain France	3	83 1.5×	30 1.2×	7 0.5×	5 0.5×	12 1.2×	8	93
Steve Babbage	1	56 1.0×	32 1.3×	6 0.4×	11 1.0×	4 0.4×	3	61

Countries citing papers authored by Jacques Patarin

Since Specialization

Citations

This map shows the geographic impact of Jacques Patarin's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Jacques Patarin with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jacques Patarin more than expected).

Fields of papers citing papers by Jacques Patarin

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Jacques Patarin. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Jacques Patarin. The network helps show where Jacques Patarin may publish in the future.

Co-authorship network of co-authors of Jacques Patarin

This figure shows the co-authorship network connecting the top 25 collaborators of Jacques Patarin. A scholar is included among the top collaborators of Jacques Patarin based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Jacques Patarin. Jacques Patarin is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

12 of 12 papers shown

1.

Gouget, Aline, et al.. (2021). Unpredictability properties in Algorand consensus protocol. 1–3. 2 indexed citations

2.

Patarin, Jacques. (2017). Mirror theory and cryptography. Applicable Algebra in Engineering Communication and Computing. 28(4). 321–338. 4 indexed citations

3.

Patarin, Jacques, et al.. (2017). Feistel Ciphers. 12 indexed citations

4.

Patarin, Jacques. (2016). Luby-Rackoff: 7 Rounds are Enough for 2^n(1-epsilon) Security. 4 indexed citations

5.

Coron, Jean-Sébastien, et al.. (2014). How to Build an Ideal Cipher: The Indifferentiability of the Feistel Construction. Journal of Cryptology. 29(1). 61–114. 12 indexed citations

6.

Lampe, Rodolphe & Jacques Patarin. (2012). Analysis of Some Natural Variants of the PKP Algorithm. 209–214. 2 indexed citations

7.

Patarin, Jacques, et al.. (2010). “I Shall Love You Until Death” (Marie-Antoinette to Axel von Fersen). Cryptologia. 34(2). 104–114. 1 indexed citations

8.

Berbain, Côme, Henri Gilbert, & Jacques Patarin. (2008). QUAD: A multivariate stream cipher with provable security. Journal of Symbolic Computation. 44(12). 1703–1723. 7 indexed citations

9.

Berbain, Côme, et al.. (2007). QUAD: Overview and Recent Developments. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 0. 3 indexed citations

10.

Patarin, Jacques, et al.. (2006). Generic Attacks on Unbalanced Feistel Schemes with Contracting Functions. HAL (Le Centre pour la Communication Scientifique Directe). 1 indexed citations

11.

Patarin, Jacques. (2000). Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt'98. Designs Codes and Cryptography. 20(2). 175–209. 8 indexed citations

12.

Patarin, Jacques. (1997). Improved security bounds for pseudorandom permutations. 142–150. 5 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact