Worst Cases and Lattice Reduction. - Damien Stehlé; Vincent Lefèvre; Paul Zimmermann (IEEE Symposium on Computer Arithmetic, 2003)

A Binary Recursive Gcd Algorithm. - Damien Stehlé; Paul Zimmermann (ANTS, 2004)

Breaking Littlewood's Cipher. - Damien Stehlé (Cryptologia, 2004)

Gal's Accurate Tables Method Revisited. - Damien Stehlé; Paul Zimmermann (IEEE Symposium on Computer Arithmetic, 2005)

Floating-Point LLL Revisited. - Phong Q. Nguyen; Damien Stehlé (EUROCRYPT, 2005)

Searching Worst Cases of a One-Variable Function Using Lattice Reduction. - Damien Stehlé; Vincent Lefèvre; Paul Zimmermann (IEEE Trans. Computers, 2005)

Algorithmique de la réduction de réseaux et application à la recherche de pires cas pour l'arrondi defonctions mathématiques. - Damien Stehlé (2005)

LLL on the Average. - Phong Q. Nguyen; Damien Stehlé (ANTS, 2006)

On the Randomness of Bits Generated by Sufficiently Smooth Functions. - Damien Stehlé (ANTS, 2006)

Worst Cases for the Exponential Function in the IEEE 754r decimal64 Format. - Vincent Lefèvre; Damien Stehlé; Paul Zimmermann (Reliable Implementation of Real Number Algorithms, 2006)

Worst Cases of a Periodic Function for Large Arguments. - Guillaume Hanrot; Vincent Lefèvre; Damien Stehlé; Paul Zimmermann (IEEE Symposium on Computer Arithmetic, 2007)

Improved Analysis of Kannan's Shortest Lattice Vector Algorithm. - Guillaume Hanrot; Damien Stehlé (CRYPTO, 2007)

Rigorous and Efficient Short Lattice Vectors Enumeration. - Xavier Pujol; Damien Stehlé (ASIACRYPT, 2008)

Speeding-Up Lattice Reduction with Random Projections (Extended Abstract). - Ali Akhavi; Damien Stehlé (LATIN, 2008)

From an LLL-reduced basis to another. - Ivan Morel; Damien Stehlé; Gilles Villard (ACM Commun. Comput. Algebra, 2008)

Worst-Case Hermite-Korkine-Zolotarev Reduced Lattice Bases - Guillaume Hanrot; Damien Stehlé (CoRR, 2008)

H-LLL: using householder inside LLL. - Ivan Morel; Damien Stehlé; Gilles Villard (ISSAC, 2009)

Solving the Shortest Lattice Vector Problem in Time 22.465n. - Xavier Pujol; Damien Stehlé (IACR Cryptol. ePrint Arch., 2009)

Efficient Public Key Encryption Based on Ideal Lattices. - Damien Stehlé; Ron Steinfeld; Keisuke Tanaka; Keita Xagawa (IACR Cryptol. ePrint Arch., 2009)

An LLL Algorithm with Quadratic Complexity. - Phong Q. Nguyen; Damien Stehlé (SIAM J. Comput., 2009)

Low-dimensional lattice basis reduction revisited. - Phong Q. Nguyen; Damien Stehlé (ACM Trans. Algorithms, 2009)

Handbook of Floating-Point Arithmetic. - Jean-Michel Muller; Nicolas Brisebarre; Florent de Dinechin; Claude-Pierre Jeannerod; Vincent Lefèvre; Guillaume Melquiond; Nathalie Revol; Damien Stehlé; Serge Torres (Birkhäuser, 2010)

Short Bases of Lattices over Number Fields. - Claus Fieker; Damien Stehlé (ANTS, 2010)

On the Extremality of an 80-Dimensional Lattice. - Damien Stehlé; Mark Watkins (ANTS, 2010)

Randomized lattice decoding: Bridging the gap between lattice reduction and sphere decoding. - Shuiyin Liu; Cong Ling 001; Damien Stehlé (ISIT, 2010)

Accelerating Lattice Reduction with FPGAs. - Jérémie Detrey; Guillaume Hanrot; Xavier Pujol; Damien Stehlé (LATINCRYPT, 2010)

Randomized Lattice Decoding - Shuiyin Liu; Cong Ling 001; Damien Stehlé (CoRR, 2010)

Faster Fully Homomorphic Encryption. - Damien Stehlé; Ron Steinfeld (IACR Cryptol. ePrint Arch., 2010)

Rigorous Perturbation Bounds of Some Matrix Factorizations. - Xiao-Wen Chang; Damien Stehlé (SIAM J. Matrix Anal. Appl., 2010)

Analyse numérique et réduction de réseaux. - Ivan Morel; Damien Stehlé; Gilles Villard (Tech. Sci. Informatiques, 2010)

Floating-Point LLL: Theoretical and Practical Aspects. - Damien Stehlé (The LLL Algorithm, 2010)

Euclidean lattices: algorithms and cryptography. (Réseaux Euclidiens : Algorithmes et Cryptographie). - Damien Stehlé (2011)

Algorithms for the Shortest and Closest Lattice Vector Problems. - Guillaume Hanrot; Xavier Pujol; Damien Stehlé (IWCC, 2011)

Analyzing Blockwise Lattice Algorithms Using Dynamical Systems. - Guillaume Hanrot; Xavier Pujol; Damien Stehlé (CRYPTO, 2011)

Making NTRU as Secure as Worst-Case Problems over Ideal Lattices. - Damien Stehlé; Ron Steinfeld (EUROCRYPT, 2011)

Decoding by embedding: Correct decoding radius and DMT optimality. - Cong Ling 001; Shuiyin Liu; Laura Luzzi; Damien Stehlé (ISIT, 2011)

An LLL-reduction algorithm with quasi-linear time complexity: extended abstract. - Andrew Novocin; Damien Stehlé; Gilles Villard (STOC, 2011)

Terminating BKZ. - Guillaume Hanrot; Xavier Pujol; Damien Stehlé (IACR Cryptol. ePrint Arch., 2011)

Decoding by Sampling: A Randomized Lattice Algorithm for Bounded Distance Decoding. - Shuiyin Liu; Cong Ling 001; Damien Stehlé (IEEE Trans. Inf. Theory, 2011)

Improved Zero-knowledge Proofs of Knowledge for the ISIS Problem, and Applications. - San Ling; Khoa Nguyen 002; Damien Stehlé; Huaxiong Wang (IACR Cryptol. ePrint Arch., 2012)

Perturbation Analysis of the QR factor R in the context of LLL lattice basis reduction. - Xiao-Wen Chang; Damien Stehlé; Gilles Villard (Math. Comput., 2012)

A new view on HJLS and PSLQ: sums and projections of lattices. - Jingwei Chen; Damien Stehlé; Gilles Villard (ISSAC, 2013)

Classical hardness of learning with errors. - Zvika Brakerski; Adeline Langlois; Chris Peikert; Oded Regev 001; Damien Stehlé (STOC, 2013)

Lattice-Based Group Signatures with Logarithmic Signature Size. - Fabien Laguillaumie; Adeline Langlois; Benoît Libert; Damien Stehlé (IACR Cryptol. ePrint Arch., 2013)

Making NTRUEncrypt and NTRUSign as Secure as Standard Worst-Case Problems over Ideal Lattices. - Damien Stehlé; Ron Steinfeld (IACR Cryptol. ePrint Arch., 2013)

Decoding by Embedding: Correct Decoding Radius and DMT Optimality. - Laura Luzzi; Damien Stehlé; Cong Ling 001 (IEEE Trans. Inf. Theory, 2013)

LLL reducing with the most significant bits. - Saruchi; Ivan Morel; Damien Stehlé; Gilles Villard (ISSAC, 2014)

Cryptanalysis of the Multilinear Map over the Integers. - Jung Hee Cheon; Kyoohyung Han; Changmin Lee 001; Hansol Ryu; Damien Stehlé (IACR Cryptol. ePrint Arch., 2014)

GGHLite: More Efficient Multilinear Maps from Ideal Lattices. - Adeline Langlois; Damien Stehlé; Ron Steinfeld (IACR Cryptol. ePrint Arch., 2014)

Semantically Secure Lattice Codes for the Gaussian Wiretap Channel. - Cong Ling 001; Laura Luzzi; Jean-Claude Belfiore; Damien Stehlé (IEEE Trans. Inf. Theory, 2014)

Fully Homomophic Encryption over the Integers Revisited. - Jung Hee Cheon; Damien Stehlé (EUROCRYPT (1), 2015)

Worst-case to average-case reductions for module lattices. - Adeline Langlois; Damien Stehlé (Des. Codes Cryptogr., 2015)

Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance. - Shi Bai 001; Adeline Langlois; Tancrède Lepoint; Damien Stehlé; Ron Steinfeld (IACR Cryptol. ePrint Arch., 2015)

Fully Secure Functional Encryption for Inner Products, from Standard Assumptions. - Benoît Libert; Damien Stehlé (IACR Cryptol. ePrint Arch., 2015)

Cryptanalysis of Gu's ideal multilinear map. - Alice Pellet-Mary; Damien Stehlé (IACR Cryptol. ePrint Arch., 2015)

Fully Secure Functional Encryption for Inner Products, from Standard Assumptions. - Shweta Agrawal 001; Benoît Libert; Damien Stehlé (CRYPTO (3), 2016)

Improved Reduction from the Bounded Distance Decoding Problem to the Unique Shortest Vector Problem in Lattices. - Shi Bai 001; Damien Stehlé; Weiqiang Wen (IACR Cryptol. ePrint Arch., 2016)

Fully Homomorphic Encryption over the Integers Revisited. - Jung Hee Cheon; Damien Stehlé (IACR Cryptol. ePrint Arch., 2016)

Sanitization of FHE Ciphertexts. - Léo Ducas; Damien Stehlé (IACR Cryptol. ePrint Arch., 2016)

Faster LLL-type Reduction of Lattice Bases. - Arnold Neumaier; Damien Stehlé (IACR Cryptol. ePrint Arch., 2016)

Tuple lattice sieving. - Shi Bai 001; Thijs Laarhoven; Damien Stehlé (LMS J. Comput. Math., 2016)

Efficient Public Trace and Revoke from Standard Assumptions: Extended Abstract. - Shweta Agrawal 001; Sanjay Bhattacherjee; Duong Hieu Phan; Damien Stehlé; Shota Yamada 001 (CCS, 2017)

Lattice Reduction Algorithms. - Damien Stehlé (ISSAC, 2017)

Hardness of k-LWE and Applications in Traitor Tracing. - San Ling; Duong Hieu Phan; Damien Stehlé; Ron Steinfeld (Algorithmica, 2017)

Efficient Public Trace and Revoke from Standard Assumptions. - Shweta Agrawal 001; Sanjay Bhattacherjee; Duong Hieu Phan; Damien Stehlé; Shota Yamada 001 (IACR Cryptol. ePrint Arch., 2017)

CRYSTALS - Kyber: a CCA-secure module-lattice-based KEM. - Joppe W. Bos; Léo Ducas; Eike Kiltz; Tancrède Lepoint; Vadim Lyubashevsky; John M. Schanck; Peter Schwabe; Damien Stehlé (IACR Cryptol. ePrint Arch., 2017)

CRYSTALS - Dilithium: Digital Signatures from Module Lattices. - Léo Ducas; Tancrède Lepoint; Vadim Lyubashevsky; Peter Schwabe; Gregor Seiler; Damien Stehlé (IACR Cryptol. ePrint Arch., 2017)

All-But-Many Lossy Trapdoor Functions and Selective Opening Chosen-Ciphertext Security from LWE. - Benoît Libert; Amin Sakzad; Damien Stehlé; Ron Steinfeld (IACR Cryptol. ePrint Arch., 2017)

Middle-Product Learning With Errors. - Miruna Rosca; Amin Sakzad; Ron Steinfeld; Damien Stehlé (IACR Cryptol. ePrint Arch., 2017)

CRYSTALS - Kyber: A CCA-Secure Module-Lattice-Based KEM. - Joppe W. Bos; Léo Ducas; Eike Kiltz; Tancrède Lepoint; Vadim Lyubashevsky; John M. Schanck; Peter Schwabe; Gregor Seiler; Damien Stehlé (EuroS&P, 2018)

Computing an LLL-reduced Basis of the Orthogonal Latice. - Jingwei Chen; Damien Stehlé; Gilles Villard (ISSAC, 2018)

Learning with Errors and Extrapolated Dihedral Cosets. - Zvika Brakerski; Elena Kirshanova; Damien Stehlé; Weiqiang Wen (Public Key Cryptography (2), 2018)

Adaptively Secure Distributed PRFs from mathsf LWE. - Benoît Libert; Damien Stehlé; Radu Titiu (TCC (2), 2018)

Computing an LLL-reduced basis of the orthogonal lattice. - Jingwei Chen; Damien Stehlé; Gilles Villard (CoRR, 2018)

Measuring, simulating and exploiting the head concavity phenomenon in BKZ. - Shi Bai 001; Damien Stehlé; Weiqiang Wen (IACR Cryptol. ePrint Arch., 2018)

Adaptively Secure Distributed PRFs from LWE. - Benoît Libert; Damien Stehlé; Radu Titiu (IACR Cryptol. ePrint Arch., 2018)

On the Ring-LWE and Polynomial-LWE problems. - Miruna Rosca; Damien Stehlé; Alexandre Wallet (IACR Cryptol. ePrint Arch., 2018)

Improved Security Proofs in Lattice-Based Cryptography: Using the Rényi Divergence Rather than the Statistical Distance. - Shi Bai 001; Tancrède Lepoint; Adeline Roux-Langlois; Amin Sakzad; Damien Stehlé; Ron Steinfeld (J. Cryptol., 2018)

CRYSTALS-Dilithium: A Lattice-Based Digital Signature Scheme. - Léo Ducas; Eike Kiltz; Tancrède Lepoint; Vadim Lyubashevsky; Peter Schwabe; Gregor Seiler; Damien Stehlé (IACR Trans. Cryptogr. Hardw. Embed. Syst., 2018)

ModFalcon: compact signatures based on module NTRU lattices. - Chitchanok Chuengsatiansup; Thomas Prest; Damien Stehlé; Alexandre Wallet; Keita Xagawa (IACR Cryptol. ePrint Arch., 2019)

An LLL Algorithm for Module Lattices. - Changmin Lee 001; Alice Pellet-Mary; Damien Stehlé; Alexandre Wallet (IACR Cryptol. ePrint Arch., 2019)

Approx-SVP in Ideal Lattices with Pre-processing. - Alice Pellet-Mary; Guillaume Hanrot; Damien Stehlé (IACR Cryptol. ePrint Arch., 2019)

Cryptanalysis of the CLT13 Multilinear Map. - Jung Hee Cheon; Kyoohyung Han; Changmin Lee 001; Hansol Ryu; Damien Stehlé (J. Cryptol., 2019)

Faster Enumeration-Based Lattice Reduction: Root Hermite Factor k1/(2k) Time kk/8+o(k). - Martin R. Albrecht; Shi Bai 001; Pierre-Alain Fouque; Paul Kirchner; Damien Stehlé; Weiqiang Wen (CRYPTO (2), 2020)

On the smoothing parameter and last minimum of random orthogonal lattices. - Elena Kirshanova; Huyen Nguyen; Damien Stehlé; Alexandre Wallet (Des. Codes Cryptogr., 2020)

Faster Enumeration-based Lattice Reduction: Root Hermite Factor k^(1/(2k)) in Time k^(k/8 + o(k)). - Martin R. Albrecht; Shi Bai 001; Pierre-Alain Fouque; Paul Kirchner; Damien Stehlé; Weiqiang Wen (IACR Cryptol. ePrint Arch., 2020)

MPSign: A Signature from Small-Secret Middle-Product Learning with Errors. - Shi Bai 001; Dipayan Das 001; Ryo Hiromasa; Miruna Rosca; Amin Sakzad; Damien Stehlé; Ron Steinfeld; Zhenfei Zhang (IACR Cryptol. ePrint Arch., 2020)

Can Round-Optimal Lattice-Based Blind Signatures be Practical? - Shweta Agrawal 001; Elena Kirshanova; Damien Stehlé; Anshu Yadav (IACR Cryptol. ePrint Arch., 2021)

Towards practical GGM-based PRF from (Module-)Learning-with-Rounding. - Chitchanok Chuengsatiansup; Damien Stehlé (IACR Cryptol. ePrint Arch., 2021)

On the Integer Polynomial Learning with Errors Problem. - Julien Devevey; Amin Sakzad; Damien Stehlé; Ron Steinfeld (IACR Cryptol. ePrint Arch., 2021)

Measure-Rewind-Measure: Tighter Quantum Random Oracle Model Proofs for One-Way to Hiding and CCA Security. - Veronika Kuchta; Amin Sakzad; Damien Stehlé; Ron Steinfeld; Shifeng Sun 001 (IACR Cryptol. ePrint Arch., 2021)

Non-applicability of the Gaborit&Aguilar-Melchor patent to Kyber and Saber. - Vadim Lyubashevsky; Damien Stehlé (IACR Cryptol. ePrint Arch., 2021)

On the hardness of the NTRU problem. - Alice Pellet-Mary; Damien Stehlé (IACR Cryptol. ePrint Arch., 2021)

Adaptively Secure Distributed PRFs from sf LWE. - Benoît Libert; Damien Stehlé; Radu Titiu (J. Cryptol., 2021)

Practical, Round-Optimal Lattice-Based Blind Signatures. - Shweta Agrawal 001; Elena Kirshanova; Damien Stehlé; Anshu Yadav (CCS, 2022)

Round-Optimal Lattice-Based Threshold Signatures, Revisited. - Shweta Agrawal 001; Damien Stehlé; Anshu Yadav (IACR Cryptol. ePrint Arch., 2022)

An Anonymous Trace-and-Revoke Broadcast Encryption Scheme. - Olivier Blazy; Sayantan Mukherjee; Huyen Nguyen; Duong Hieu Phan; Damien Stehlé (IACR Cryptol. ePrint Arch., 2022)

On Rejection Sampling in Lyubashevsky's Signature Scheme. - Julien Devevey; Omar Fawzi; Alain Passelègue; Damien Stehlé (IACR Cryptol. ePrint Arch., 2022)

On Module Unique-SVP and NTRU. - Joël Felderhoff; Alice Pellet-Mary; Damien Stehlé (IACR Cryptol. ePrint Arch., 2022)

HERMES: Efficient Ring Packing using MLWE Ciphertexts and Application to Transciphering. - Youngjin Bae; Jung Hee Cheon; Jaehyung Kim 002; Jai Hyun Park; Damien Stehlé (IACR Cryptol. ePrint Arch., 2023)

Homomorphic Multiple Precision Multiplication for CKKS and Reduced Modulus Consumption. - Jung Hee Cheon; Wonhee Cho 001; Jaehyung Kim 002; Damien Stehlé (IACR Cryptol. ePrint Arch., 2023)

A Detailed Analysis of Fiat-Shamir with Aborts. - Julien Devevey; Pouria Fallahpour; Alain Passelègue; Damien Stehlé (IACR Cryptol. ePrint Arch., 2023)

G+G: A Fiat-Shamir Lattice Signature Based on Convolved Gaussians. - Julien Devevey; Alain Passelègue; Damien Stehlé (IACR Cryptol. ePrint Arch., 2023)

Ideal-SVP is Hard for Small-Norm Uniform Prime Ideals. - Joël Felderhoff; Alice Pellet-Mary; Damien Stehlé; Benjamin Wesolowski (IACR Cryptol. ePrint Arch., 2023)

Efficient Updatable Public-Key Encryption from Lattices. - Calvin Abou Haidar; Alain Passelègue; Damien Stehlé (IACR Cryptol. ePrint Arch., 2023)

Fast and Accurate Homomorphic Softmax Evaluation. - Wonhee Cho 001; Guillaume Hanrot; Taeseong Kim; Minje Park; Damien Stehlé (CCS, 2024)

Attacks Against the IND-CPAD Security of Exact FHE Schemes. - Jung Hee Cheon; Hyeongmin Choe; Alain Passelègue; Damien Stehlé; Elias Suvanto (CCS, 2024)

Plaintext-Ciphertext Matrix Multiplication and FHE Bootstrapping: Fast and Fused. - Youngjin Bae; Jung Hee Cheon; Guillaume Hanrot; Jai Hyun Park; Damien Stehlé (IACR Cryptol. ePrint Arch., 2024)

Bootstrapping Bits with CKKS. - Youngjin Bae; Jung Hee Cheon; Jaehyung Kim 002; Damien Stehlé (IACR Cryptol. ePrint Arch., 2024)

Bootstrapping Small Integers With CKKS. - Youngjin Bae; Jaehyung Kim 002; Damien Stehlé; Elias Suvanto (IACR Cryptol. ePrint Arch., 2024)

Attacks Against the INDCPA-D Security of Exact FHE Schemes. - Jung Hee Cheon; Hyeongmin Choe; Alain Passelègue; Damien Stehlé; Elias Suvanto (IACR Cryptol. ePrint Arch., 2024)

Quantum Oblivious LWE Sampling and Insecurity of Standard Model Lattice-Based SNARKs. - Thomas Debris-Alazard; Pouria Fallahpour; Damien Stehlé (IACR Cryptol. ePrint Arch., 2024)

Low Communication Threshold Fully Homomorphic Encryption. - Alain Passelègue; Damien Stehlé (IACR Cryptol. ePrint Arch., 2024)

HAETAE: Shorter Lattice-Based Fiat-Shamir Signatures. - Jung Hee Cheon; Hyeongmin Choe; Julien Devevey; Tim Güneysu; Dongyeon Hong; Markus Krausz; Georg Land; Marc Möller; Damien Stehlé; MinJune Yi (IACR Trans. Cryptogr. Hardw. Embed. Syst., 2024)

SHIP: A Shallow and Highly Parallelizable CKKS Bootstrapping Algorithm. - Jung Hee Cheon; Guillaume Hanrot; Jongmin Kim 007; Damien Stehlé (IACR Cryptol. ePrint Arch., 2025)

Fast Homomorphic Linear Algebra with BLAS. - Youngjin Bae; Jung Hee Cheon; Guillaume Hanrot; Jai Hyun Park; Damien Stehlé (CoRR, 2025)