Institution · CryptoExperts (France)
Most cited papers from CryptoExperts (France)
What are the most cited papers from CryptoExperts (France)?
The most cited paper from CryptoExperts (France) is "Lattice Signatures and Bimodal Gaussians" (Léo Ducas, Alain Durmus, Tancrède Lepoint et al., 2013), with 549 citations. Next come "Practical Multilinear Maps over the Integers" (445) and "Masking against Side-Channel Attacks: A Formal Security Proof" (372).
Showing 50 of 59 papers. Every paper with more than 42 citations is listed.
| # | Paper | ||
|---|---|---|---|
| 1 | Lattice Signatures and Bimodal Gaussians Léo Ducas, Alain Durmus, Tancrède Lepoint et al. · Lecture notes in computer science | 2013 | 549 |
| 2 | Practical Multilinear Maps over the Integers Jean-Sébastien Coron, Tancrède Lepoint, Mehdi Tibouchi · Lecture notes in computer science | 2013 | 445 |
| 3 | Masking against Side-Channel Attacks: A Formal Security Proof Emmanuel Prouff, Matthieu Rivain · Lecture notes in computer science | 2013 | 372 |
| 4 | Batch Fully Homomorphic Encryption over the Integers Jung Hee Cheon, Jean-Sébastien Coron, Jinsu Kim et al. · Lecture notes in computer science | 2013 | 361 |
| 5 | Mutual Information Analysis: a Comprehensive Study Lejla Batina, Benedikt Gierlichs, Emmanuel Prouff et al. · Journal of Cryptology | 20 Oct 2010 | 324 |
| 6 | Modeling and Verifying Security Protocols with the Applied Pi Calculus and ProVerif Bruno Blanchet · Foundations and Trends® in Privacy and Security | 31 Oct 2016 | 320 |
| 7 | Fast Homomorphic Evaluation of Deep Discretized Neural Networks Florian Bourse, Michele Minelli, Matthias Minihold et al. · Lecture notes in computer science | 2018 | 295 |
| 8 | A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic Razvan Barbulescu, Pierrick Gaudry, Antoine Joux et al. · Lecture notes in computer science | 2014 | 231 |
| 9 | Using quantum key distribution for cryptographic purposes: A survey Romain Alléaume et al. · Theoretical Computer Science | 17 Sep 2014 | 223 |
| 10 | Introduction to Security and Privacy on the Blockchain Harry Halpin, Marta Piekarska | Apr 2017 | 203 |
| 11 | Verified Models and Reference Implementations for the TLS 1.3 Standard Candidate Karthikeyan Bhargavan, Bruno Blanchet, Nadim Kobeissi | May 2017 | 203 |
| 12 | Univariate side channel attacks and leakage modeling Julien Doget, Emmanuel Prouff, Matthieu Rivain et al. · Journal of Cryptographic Engineering | Aug 2011 | 202 |
| 13 | Scale-Invariant Fully Homomorphic Encryption over the Integers Jean-Sébastien Coron, Tancrède Lepoint, Mehdi Tibouchi · Lecture notes in computer science | 2014 | 183 |
| 14 | Higher-Order Side Channel Security and Mask Refreshing Jean-Sébastien Coron, Emmanuel Prouff, Matthieu Rivain et al. · Lecture notes in computer science | 2014 | 167 |
| 15 | A New Index Calculus Algorithm with Complexity $$L(1/4+o(1))$$ in Small Characteristic Antoine Joux · Lecture notes in computer science | 2014 | 157 |
| 16 | Automated Verification for Secure Messaging Protocols and Their Implementations: A Symbolic and Computational Approach Nadim Kobeissi, Karthikeyan Bhargavan, Bruno Blanchet | Apr 2017 | 155 |
| 17 | New Multilinear Maps Over the Integers Jean-Sébastien Coron, Tancrède Lepoint, Mehdi Tibouchi · Lecture notes in computer science | 2015 | 149 |
| 18 | Sosemanuk, a Fast Software-Oriented Stream Cipher Côme Berbain, Olivier Billet, Anne Canteaut et al. · Lecture notes in computer science | 2008 | 149 |
| 19 | On the Practical (In-)Security of 64-bit Block Ciphers Karthikeyan Bhargavan, Gaëtan Leurent | 24 Oct 2016 | 144 |
| 20 | The Applied Pi Calculus Martı́n Abadi, Bruno Blanchet, Cédric Fournet · Journal of the ACM | 26 Oct 2017 | 140 |
| 21 | Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations Jean-Sébastien Coron, Craig Gentry, Shai Halevi et al. · Lecture notes in computer science | 2015 | 138 |
| 22 | NFLlib: NTT-Based Fast Lattice Library Carlos Aguilar-Melchor, Joris Barrier, Serge Guelton et al. · Lecture notes in computer science | 2016 | 129 |
| 23 | Higher-Order Masking Schemes for S-Boxes Claude Carlet, Louis Goubin, Emmanuel Prouff et al. · Lecture notes in computer science | 2012 | 114 |
| 24 | Transcript Collision Attacks: Breaking Authentication in TLS, IKE, and SSH Karthikeyan Bhargavan, Gaëtan Leurent | 2016 | 108 |
| 25 | Stream Ciphers: A Practical Solution for Efficient Homomorphic-Ciphertext Compression Anne Canteaut, Sergiu Carpov, Caroline Fontaine et al. · Lecture notes in computer science | 2016 | 104 |
| 26 | Two Attacks on a White-Box AES Implementation Tancrède Lepoint, Matthieu Rivain, Yoni De Mulder et al. · Lecture notes in computer science | 2014 | 102 |
| 27 | Studying the locator polynomials of minimum weight codewords of BCH codes Daniel Augot, Pascale Charpin, Nicolas Sendrier · IEEE Transactions on Information Theory | May 1992 | 101 |
| 28 | How Fast Can Higher-Order Masking Be in Software? Dahmun Goudarzi, Matthieu Rivain · Lecture notes in computer science | 2017 | 100 |
| 29 | Improved Security Proofs in Lattice-Based Cryptography: Using the Rényi Divergence Rather Than the Statistical Distance Shi Zhong Bai, Adeline Roux-Langlois, Tancrède Lepoint et al. · Lecture notes in computer science | 2015 | 99 |
| 30 | On the Fly Authentication and Signature Schemes Based on Groups of Unknown Order Marc Girault, Guillaume Poupard, Jacques Stern · Journal of Cryptology | 13 Sep 2006 | 97 |
| 31 | Affine Masking against Higher-Order Side Channel Analysis Guillaume Fumaroli, Ange Martinelli, Emmanuel Prouff et al. · Lecture notes in computer science | 2011 | 97 |
| 32 | Cryptanalysis of GGH15 Multilinear Maps Jean-Sébastien Coron, Moon Sung Lee, Tancrède Lepoint et al. · Lecture notes in computer science | 2016 | 82 |
| 33 | Conversion of Security Proofs from One Leakage Model to Another: A New Issue Jean-Sébastien Coron, Christophe Giraud, Emmanuel Prouff et al. · Lecture notes in computer science | 2012 | 82 |
| 34 | maskVerif: Automated Verification of Higher-Order Masking in Presence of Physical Defaults Gilles Barthe, Sonia Belaïd, Gaëtan Cassiers et al. · Lecture notes in computer science | 2019 | 75 |
| 35 | Masking the GLP Lattice-Based Signature Scheme at Any Order Gilles Barthe, Sonia Belaïd, Thomas Espitau et al. · Lecture notes in computer science | 2018 | 74 |
| 36 | Automated analysis of security protocols with global state Steve Kremer, Robert Künnemann · Journal of Computer Security | 3 Aug 2016 | 73 |
| 37 | Syndrome Decoding in the Head: Shorter Signatures from Zero-Knowledge Proofs Thibauld Feneuil, Antoine Joux, Matthieu Rivain · Lecture notes in computer science | 2022 | 71 |
| 38 | White-Box Security Notions for Symmetric Encryption Schemes Cécile Delerablée, Tancrède Lepoint, Pascal Paillier et al. · Lecture notes in computer science | 2014 | 68 |
| 39 | Direct Construction of Recursive MDS Diffusion Layers Using Shortened BCH Codes Daniel Augot, Matthieu Finiasz · Lecture notes in computer science | 2015 | 67 |
| 40 | Secure distributed programming with value-dependent types Nikhil Swamy, Juan Chen, Cédric Fournet et al. · Journal of Functional Programming | Jul 2013 | 64 |
| 41 | Faster Index Calculus for the Medium Prime Case Application to 1175-bit and 1425-bit Finite Fields Antoine Joux · Lecture notes in computer science | 2013 | 61 |
| 42 | Separation Results on the “One-More” Computational Problems Emmanuel Bresson, Jean Monnerat, Damien Vergnaud · Lecture notes in computer science | 4 Apr 2008 | 61 |
| 43 | Scalar multiplication on Weierstraß elliptic curves from Co-Z arithmetic Raveen R. Goundar, Marc Jóye, Atsuko Miyaji et al. · Journal of Cryptographic Engineering | Aug 2011 | 59 |
| 44 | How to Estimate the Success Rate of Higher-Order Side-Channel Attacks Victor Lomné, Emmanuel Prouff, Matthieu Rivain et al. · Lecture notes in computer science | 2014 | 57 |
| 45 | Tight Private Circuits: Achieving Probing Security with the Least Refreshing Sonia Belaïd, Dahmun Goudarzi, Matthieu Rivain · Lecture notes in computer science | 2018 | 55 |
| 46 | Theoretical and practical aspects of mutual information-based side channel analysis Emmanuel Prouff, Matthieu Rivain · International Journal of Applied Cryptography | 2010 | 55 |
| 47 | Catala: a programming language for the law Denis Merigoux, Nicolas Chataing, Jonathan Protzenko · Proceedings of the ACM on Programming Languages | 19 Aug 2021 | 52 |
| 48 | Multi-user Collisions: Applications to Discrete Logarithm, Even-Mansour and PRINCE Pierre-Alain Fouque, Antoine Joux, Chrysanthi Mavromati · Lecture notes in computer science | 2014 | 52 |
| 49 | Exhaustive search for small dimension recursive MDS diffusion layers for block ciphers and hash functions Daniel Augot, Matthieu Finiasz | Jul 2013 | 50 |
| 50 | Verified Cryptographic Implementations for TLS Karthikeyan Bhargavan, Cédric Fournet, Ricardo Corin et al. · ACM Transactions on Information and System Security | Mar 2012 | 50 |
Citations are OpenAlex's own counts, from its 2026-09-23 snapshot, so the ranking can differ from Google Scholar or Web of Science. A paper is listed for an institution when any of its authors gave it as an affiliation; retracted papers and papers whose citation count cannot be traced to citing works are left out, and a preprint and the article it became are shown once. Release dates are OpenAlex's: where a source gave only a month or a year, that is what is shown. How the lists are chosen.