Damien Stehlé

Laura Luzzi, Damien Stehlé, Cong Ling: Decoding by Embedding: Correct Decoding Radius and DMT Optimality. IEEE Transactions on Information Theory 59(5): 2960-2973 (2013)

San Ling, Khoa Nguyen, Damien Stehlé, Huaxiong Wang: Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications. Public Key Cryptography 2013: 107-124

Damien Stehlé, Ron Steinfeld: Making NTRUEncrypt and NTRUSign as Secure as Standard Worst-Case Problems over Ideal Lattices. IACR Cryptology ePrint Archive 2013: 4 (2013)

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

Cong Ling, Laura Luzzi, Jean-Claude Belfiore, Damien Stehlé: Semantically Secure Lattice Codes for the Gaussian Wiretap Channel. CoRR abs/1210.6673 (2012)

San Ling, Damien Stehlé: A Lattice-Based Traitor Tracing Scheme. IACR Cryptology ePrint Archive 2012: 88 (2012)

Adeline Langlois, Damien Stehlé: Worst-Case to Average-Case Reductions for Module Lattices. IACR Cryptology ePrint Archive 2012: 90 (2012)

Adeline Langlois, Damien Stehlé: Hardness of decision (R)LWE for any modulus. IACR Cryptology ePrint Archive 2012: 91 (2012)

San Ling, Khoa Nguyen, Damien Stehlé, Huaxiong Wang: Improved Zero-knowledge Proofs of Knowledge for the ISIS Problem, and Applications. IACR Cryptology ePrint Archive 2012: 569 (2012)

Shuiyin Liu, Cong Ling, Damien Stehlé: Decoding by Sampling: A Randomized Lattice Algorithm for Bounded Distance Decoding. IEEE Transactions on Information Theory 57(9): 5933-5945 (2011)

Guillaume Hanrot, Xavier Pujol, Damien Stehlé: Algorithms for the Shortest and Closest Lattice Vector Problems. IWCC 2011: 159-190

Guillaume Hanrot, Xavier Pujol, Damien Stehlé: Analyzing Blockwise Lattice Algorithms Using Dynamical Systems. CRYPTO 2011: 447-464

Damien Stehlé, Ron Steinfeld: Making NTRU as Secure as Worst-Case Problems over Ideal Lattices. EUROCRYPT 2011: 27-47

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

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

Cong Ling, Shuiyin Liu, Laura Luzzi, Damien Stehlé: Decoding by Embedding: Correct Decoding Radius and DMT Optimality. CoRR abs/1102.2936 (2011)

Guillaume Hanrot, Xavier Pujol, Damien Stehlé: Terminating BKZ. IACR Cryptology ePrint Archive 2011: 198 (2011)

Jean-Michel Muller, Nicolas Brisebarre, Florent de Dinechin, Claude-Pierre Jeannerod, Vincent Lefèvre, Guillaume Melquiond, Nathalie Revol, Damien Stehlé, Serge Torres: Handbook of Floating-Point Arithmetic. Birkhäuser 2010, isbn 978-0-8176-4704-9, pp. I-XXIII, 1-572

Xiao-Wen Chang, Damien Stehlé: Rigorous Perturbation Bounds of Some Matrix Factorizations. SIAM J. Matrix Analysis Applications 31(5): 2841-2859 (2010)

Ivan Morel, Damien Stehlé, Gilles Villard: Analyse numérique et réduction de réseaux. Technique et Science Informatiques 29(1): 115-144 (2010)

Claus Fieker, Damien Stehlé: Short Bases of Lattices over Number Fields. ANTS 2010: 157-173

Damien Stehlé, Mark Watkins: On the Extremality of an 80-Dimensional Lattice. ANTS 2010: 340-356

Damien Stehlé, Ron Steinfeld: Faster Fully Homomorphic Encryption. ASIACRYPT 2010: 377-394

Shuiyin Liu, Cong Ling, Damien Stehlé: Randomized lattice decoding: Bridging the gap between lattice reduction and sphere decoding. ISIT 2010: 2263-2267

Jérémie Detrey, Guillaume Hanrot, Xavier Pujol, Damien Stehlé: Accelerating Lattice Reduction with FPGAs. LATINCRYPT 2010: 124-143

Shuiyin Liu, Cong Ling, Damien Stehlé: Randomized Lattice Decoding. CoRR abs/1003.0064 (2010)

Damien Stehlé, Ron Steinfeld: Faster Fully Homomorphic Encryption. IACR Cryptology ePrint Archive 2010: 299 (2010)

Phong Q. Nguyen, Damien Stehlé: An LLL Algorithm with Quadratic Complexity. SIAM J. Comput. 39(3): 874-903 (2009)

Phong Q. Nguyen, Damien Stehlé: Low-dimensional lattice basis reduction revisited. ACM Transactions on Algorithms 5(4) (2009)

Damien Stehlé, Ron Steinfeld, Keisuke Tanaka, Keita Xagawa: Efficient Public Key Encryption Based on Ideal Lattices. ASIACRYPT 2009: 617-635

Ivan Morel, Damien Stehlé, Gilles Villard: H-LLL: using householder inside LLL. ISSAC 2009: 271-278

Damien Stehlé, Ron Steinfeld, Keisuke Tanaka, Keita Xagawa: Efficient Public Key Encryption Based on Ideal Lattices. IACR Cryptology ePrint Archive 2009: 285 (2009)

Xavier Pujol, Damien Stehlé: Solving the Shortest Lattice Vector Problem in Time 2^2.465n. IACR Cryptology ePrint Archive 2009: 605 (2009)

Xavier Pujol, Damien Stehlé: Rigorous and Efficient Short Lattice Vectors Enumeration. ASIACRYPT 2008: 390-405

Vincent Lefèvre, Damien Stehlé, Paul Zimmermann: Worst Cases for the Exponential Function in the IEEE 754r decimal64 Format. Reliable Implementation of Real Number Algorithms 2008: 114-126

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

Guillaume Hanrot, Damien Stehlé: Worst-Case Hermite-Korkine-Zolotarev Reduced Lattice Bases. CoRR abs/0801.3331 (2008)

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

Guillaume Hanrot, Damien Stehlé: Improved Analysis of Kannan's Shortest Lattice Vector Algorithm. CRYPTO 2007: 170-186

Guillaume Hanrot, Damien Stehlé: Improved Analysis of Kannan's Shortest Lattice Vector Algorithm. CoRR abs/0705.0965 (2007)

Phong Q. Nguyen, Damien Stehlé: LLL on the Average. ANTS 2006: 238-256

Damien Stehlé: On the Randomness of Bits Generated by Sufficiently Smooth Functions. ANTS 2006: 257-274

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

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

Damien Stehlé, Paul Zimmermann: Gal's Accurate Tables Method Revisited. IEEE Symposium on Computer Arithmetic 2005: 257-264

Phong Q. Nguyen, Damien Stehlé: Floating-Point LLL Revisited. EUROCRYPT 2005: 215-233

Phong Q. Nguyen, Damien Stehlé: Low-Dimensional Lattice Basis Reduction Revisited. ANTS 2004: 338-357

Damien Stehlé, Paul Zimmermann: A Binary Recursive Gcd Algorithm. ANTS 2004: 411-425

Damien Stehlé, Vincent Lefèvre, Paul Zimmermann: Worst Cases and Lattice Reduction. IEEE Symposium on Computer Arithmetic 2003: 142-147