Damien Stehlé

8.4k total citations · 1 hit paper
33 papers, 1.1k citations indexed

About

Damien Stehlé is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Information Systems. According to data from OpenAlex, Damien Stehlé has authored 33 papers receiving a total of 1.1k indexed citations (citations by other indexed papers that have themselves been cited), including 28 papers in Artificial Intelligence, 15 papers in Computational Theory and Mathematics and 9 papers in Information Systems. Recurrent topics in Damien Stehlé's work include Cryptography and Data Security (23 papers), Coding theory and cryptography (9 papers) and Cryptography and Residue Arithmetic (9 papers). Damien Stehlé is often cited by papers focused on Cryptography and Data Security (23 papers), Coding theory and cryptography (9 papers) and Cryptography and Residue Arithmetic (9 papers). Damien Stehlé collaborates with scholars based in France, Australia and United Kingdom. Damien Stehlé's co-authors include Adeline Roux-Langlois, Cong Ling, Tancrède Lepoint, Eike Kiltz, Gregor Seiler, Léo Ducas, Vadim Lyubashevsky, Peter Schwabe, Phong Q. Nguyễn and Vincent Lefèvre and has published in prestigious journals such as IEEE Transactions on Information Theory, Mathematics of Computation and IEEE Transactions on Computers.

In The Last Decade

Damien Stehlé

33 papers receiving 1.1k citations

Hit Papers

align trajectories

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

CRYSTALS-Dilithium: A Lattice-Based Digital Signature Scheme

2018 280 citations Tancrède Lepoint, Damien Stehlé et al. IACR Transactions on Cryptographic Hardware and Embedded Systems profile →

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Damien Stehlé France	13	697	386	287	275	205	33	1.1k
Arjen K. Lenstra United States	21	1.0k 1.5×	329 0.9×	560 2.0×	169 0.6×	293 1.4×	55	1.4k
Daniel Panario Canada	14	623 0.9×	206 0.5×	227 0.8×	325 1.2×	175 0.9×	127	923
René Peralta United States	14	612 0.9×	328 0.8×	120 0.4×	165 0.6×	272 1.3×	40	969
Deng Tang China	16	741 1.1×	308 0.8×	75 0.3×	501 1.8×	626 3.1×	63	1.3k
Konstantin Makarychev United States	18	349 0.5×	553 1.4×	189 0.7×	99 0.4×	427 2.1×	68	1.2k
Nicholas J. A. Harvey United States	18	302 0.4×	299 0.8×	121 0.4×	357 1.3×	1.0k 5.0×	52	1.5k
Dimitris Papailiopoulos United States	15	856 1.2×	332 0.9×	179 0.6×	296 1.1×	1.5k 7.1×	42	2.0k
Fréderik Vercauteren Belgium	21	2.0k 2.9×	362 0.9×	1.3k 4.5×	126 0.5×	251 1.2×	58	2.3k
René Cumplido Mexico	14	322 0.5×	94 0.2×	132 0.5×	128 0.5×	135 0.7×	86	710
Arnold Schönhage Germany	14	728 1.0×	879 2.3×	333 1.2×	161 0.6×	172 0.8×	29	1.5k

Countries citing papers authored by Damien Stehlé

Since Specialization

Citations

This map shows the geographic impact of Damien Stehlé'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 Damien Stehlé with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Damien Stehlé more than expected).

Fields of papers citing papers by Damien Stehlé

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Damien Stehlé. 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 Damien Stehlé. The network helps show where Damien Stehlé may publish in the future.

Co-authorship network of co-authors of Damien Stehlé

This figure shows the co-authorship network connecting the top 25 collaborators of Damien Stehlé. A scholar is included among the top collaborators of Damien Stehlé 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 Damien Stehlé. Damien Stehlé 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:

20 of 20 papers shown

Cheon, Jung Hee, et al.. (2024). HAETAE: Shorter Lattice-Based Fiat-Shamir Signatures. IACR Transactions on Cryptographic Hardware and Embedded Systems. 2024(3). 25–75. 5 indexed citations

Stehlé, Damien, et al.. (2024). Quantum Oblivious LWE Sampling and Insecurity of Standard Model Lattice-Based SNARKs. SPIRE - Sciences Po Institutional REpository. 423–434. 3 indexed citations

Agrawal, Shweta, et al.. (2022). Practical, Round-Optimal Lattice-Based Blind Signatures. Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security. 39–53. 11 indexed citations

Libert, Benôıt, et al.. (2021). Adaptively Secure Distributed PRFs from $$\textsf {LWE}$$. Journal of Cryptology. 34(3). 1 indexed citations

Cheon, Jung Hee, Kyoohyung Han, Changmin Lee, Hansol Ryu, & Damien Stehlé. (2018). Cryptanalysis of the CLT13 Multilinear Map. Journal of Cryptology. 32(2). 547–565. 3 indexed citations

Agrawal, Shweta, et al.. (2017). Efficient Public Trace and Revoke from Standard Assumptions. Kent Academic Repository (University of Kent). 2277–2293. 7 indexed citations

Bai, Shi, Tancrède Lepoint, Adeline Roux-Langlois, et al.. (2017). Improved Security Proofs in Lattice-Based Cryptography: Using the Rényi Divergence Rather than the Statistical Distance. Journal of Cryptology. 31(2). 610–640. 22 indexed citations

Bai, Shi, Thijs Laarhoven, & Damien Stehlé. (2016). Tuple lattice sieving. LMS Journal of Computation and Mathematics. 19(A). 146–162. 7 indexed citations

Ling, San, Duong Hieu Phan, Damien Stehlé, & Ron Steinfeld. (2016). Hardness of k-LWE and Applications in Traitor Tracing. Algorithmica. 79(4). 1318–1352. 4 indexed citations

10.

Ling, Cong, Laura Luzzi, Jean‐Claude Belfiore, & Damien Stehlé. (2014). Semantically Secure Lattice Codes for the Gaussian Wiretap Channel. IEEE Transactions on Information Theory. 60(10). 6399–6416. 105 indexed citations

11.

Chang, Xiao-Wen, Damien Stehlé, & Gilles Villard. (2012). Perturbation Analysis of the QR factor R in the context of LLL lattice basis reduction. Mathematics of Computation. 81(279). 1487–1511. 9 indexed citations

12.

Stehlé, Damien, et al.. (2011). An LLL-reduction algorithm with quasi-linear time complexity. HAL (Le Centre pour la Communication Scientifique Directe). 403–412. 18 indexed citations

13.

Stehlé, Damien, et al.. (2009). From an LLL-reduced basis to another. ACM communications in computer algebra. 42(3). 142–143. 3 indexed citations

14.

Nguyễn, Phong Q. & Damien Stehlé. (2009). An LLL Algorithm with Quadratic Complexity. SIAM Journal on Computing. 39(3). 874–903. 45 indexed citations

15.

Nguyễn, Phong Q. & Damien Stehlé. (2009). Low-dimensional lattice basis reduction revisited. ACM Transactions on Algorithms. 5(4). 1–48. 29 indexed citations

16.

Hanrot, Guillaume, Vincent Lefèvre, Damien Stehlé, & Paul Zimmermann. (2007). Worst Cases of a Periodic Function for Large Arguments. SPIRE - Sciences Po Institutional REpository. 133–140. 3 indexed citations

17.

Hanrot, Guillaume & Damien Stehlé. (2007). Improved Analysis of Kannan's Shortest Lattice Vector Algorithm (Extended Abstract). 3 indexed citations

18.

Stehlé, Damien, Vincent Lefèvre, & Paul Zimmermann. (2005). Searching worst cases of a one-variable function using lattice reduction. IEEE Transactions on Computers. 54(3). 340–346. 13 indexed citations

19.

Stehlé, Damien & Paul Zimmermann. (2005). Gal's Accurate Tables Method Revisited. HAL (Le Centre pour la Communication Scientifique Directe). 257–264. 2 indexed citations

20.

Stehlé, Damien. (2004). BREAKING LITTLEWOOD'S CIPHER. Cryptologia. 28(4). 341–357. 1 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