D. Stehlé

发表

Classical hardness of learning with errors

Damien Stehlé, Zvika Brakerski, Adeline Langlois, 2013, STOC '13.

Making NTRU as Secure as Worst-Case Problems over Ideal Lattices

Ron Steinfeld, Damien Stehlé, D. Stehlé, 2011, EUROCRYPT.

Faster LLL-type Reduction of Lattice Bases

Damien Stehlé, Arnold Neumaier, A. Neumaier, 2016, IACR Cryptol. ePrint Arch..

Analyzing Blockwise Lattice Algorithms Using

D. Stehlé, G. Hanrot, 2011 .

Euclidean lattices: algorithms and cryptography

D. Stehlé, 2011 .

Chapter 1 Floating-Point LLL : Theoretical and Practical Aspects

D. Stehlé, Sydney, Lyon Inria / ´ Ens Lyon, 2009 .

Speeding-up lattice reduction with random projections

D. Stehlé, A. Akhavi, 2008 .

Faster Enumeration-based Lattice Reduction: Root Hermite Factor k in Time k o(k)

Martin R. Albrecht, D. Stehlé, Pierre-Alain Fouque, 2020 .

C R ] 2 3 O ct 2 01 7 Learning With Errors and Extrapolated Dihedral Cosets

Zvika Brakerski, D. Stehlé, Weiqiang Wen, 2017 .

Algorithms for the Shortest and Closest Lattice

D. Stehlé, G. Hanrot, X. Pujol, 2013 .

A COMPLETE WORST-CASE ANALYSIS OF KANNAN ’ S SHORTEST LATTICE VECTOR ALGORITHM

D. Stehlé, G. Hanrot, 2010 .

Efficient Public Key Encryption Based on Ideal

D. Stehlé, Ron Steinfeld, K. Tanaka, 2009 .

CRYSTALS-Dilithium Algorithm Specifications and Supporting Documentation

Tancrède Lepoint, Eike Kiltz, D. Stehlé, 2017 .

Advanced Cryptographic Primitives Course 3: The Learning With Errors Problem

Damien Stehlé, D. Stehlé, 2014 .

Floating-Point Formats and Environment

Jean-Michel Muller, Nicolas Brisebarre, Florent de Dinechin, 2010 .

Making NTRUEncrypt and NTRUSign as Secure as Standard Worst-Case Problems over Ideal Lattices

Ron Steinfeld, Damien Stehlé, D. Stehlé, 2013, IACR Cryptol. ePrint Arch..

CRYSTALS-Kyber Algorithm Speci cations And Supporting Documentation ( version 2 . 0 )

Joppe W. Bos, John M. Schanck, Tancrède Lepoint, 2019 .

Cryptanalysis on the Multilinear Map over the Integers and its Related Problems ∗

J. Cheon, D. Stehlé, Changmin Lee, 2017 .

An Anonymous Trace-and-Revoke Broadcast Encryption Scheme

Damien Stehlé, Duong Hieu Phan, Olivier Blazy, 2021, ACISP.

Round-Optimal Lattice-Based Threshold Signatures, Revisited

D. Stehlé, Shweta Agrawal, Anshu Yadav, 2022, IACR Cryptol. ePrint Arch..

Decoding by embedding: Correct decoding radius and DMT optimality

D. Stehlé, Cong Ling, Laura Luzzi, 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

An LLL-reduction algorithm with quasi-linear time complexity

G. Villard, D. Stehlé, A. Novocin, 2011 .

On Module Unique-SVP and NTRU

D. Stehlé, Joël Felderhoff, Alice Pellet-Mary, 2022, IACR Cryptol. ePrint Arch..

Solving Problems through Algebraic Computation and Efficient Software

Damien Stehlé, Pierrick Gaudry, Céline Simon, 2005 .

Adaptively Secure Distributed PRFs from LWE\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\textsf {LWE}$$\end{documen

Benoît Libert, D. Stehlé, Radu Titiu, 2021, Journal of Cryptology.

An LLL Algorithm for Module Lattices ( full version )

D. Stehlé, Changmin Lee, Alexandre Wallet, 2019 .

All-But-Many Lossy Trapdoor Functions and Selective Opening Chosen-Ciphertext Security from LWE

Ron Steinfeld, Damien Stehlé, Benoît Libert, 2017, CRYPTO.

Semantically Secure Lattice Codes for the Gaussian Wiretap Channel

Cong Ling, Damien Stehlé, Jean-Claude Belfiore, 2012, IEEE Transactions on Information Theory.

Accelerating Lattice Reduction with FPGAs

Damien Stehlé, Guillaume Hanrot, Jérémie Detrey, 2010, LATINCRYPT.

Faster Fully Homomorphic Encryption

Ron Steinfeld, Damien Stehlé, D. Stehlé, 2010, ASIACRYPT.

CRYSTALS - Kyber: A CCA-Secure Module-Lattice-Based KEM

Damien Stehlé, Peter Schwabe, Eike Kiltz, 2017, 2018 IEEE European Symposium on Security and Privacy (EuroS&P).

CRYSTALS - Dilithium: Digital Signatures from Module Lattices

Damien Stehlé, Peter Schwabe, Léo Ducas, 2017, IACR Cryptol. ePrint Arch..

Worst-case to average-case reductions for module lattices

Damien Stehlé, Adeline Langlois, D. Stehlé, 2014, Designs, Codes and Cryptography.

Definitions and Basic Notions

Jean-Michel Muller, Nicolas Brisebarre, Florent de Dinechin, 2010 .

Algorithms for the Shortest and Closest Lattice Vector Problems

Damien Stehlé, Guillaume Hanrot, Xavier Pujol, 2011, IWCC.

Faster Enumeration-based Lattice Reduction: Root Hermite Factor k^(1/(2k)) in Time k^(k/8 + o(k))

Damien Stehlé, Martin R. Albrecht, Shi Bai, 2020, IACR Cryptol. ePrint Arch..

Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices

Damien Stehlé, Guillaume Hanrot, D. Stehlé, 2000, ICALP.

CRYSTALS-Kyber Algorithm Specifications And Supporting Documentation

Damien Stehlé, Peter Schwabe, Eike Kiltz, 2017 .

Cryptanalysis of the Multilinear Map over the Integers

Jung Hee Cheon, Damien Stehlé, Hansol Ryu, 2014, EUROCRYPT.

Decoding by Embedding: Correct Decoding Radius and DMT Optimality

Damien Stehlé, Laura Luzzi, Cong Ling, 2011, IEEE Transactions on Information Theory.

An LLL Algorithm with Quadratic Complexity

Damien Stehlé, Phong Q. Nguyen, D. Stehlé, 2009, SIAM J. Comput..

On the Randomness of Bits Generated by Sufficiently Smooth Functions

Damien Stehlé, D. Stehlé, 2006, ANTS.

Floating-Point LLL Revisited

Damien Stehlé, Phong Q. Nguyen, D. Stehlé, 2005, EUROCRYPT.

Worst cases and lattice reduction

Vincent Lefèvre, Damien Stehlé, Paul Zimmermann, 2003, Proceedings 2003 16th IEEE Symposium on Computer Arithmetic.

Handbook of Floating-Point Arithmetic (2nd Ed.)

Jean-Michel Muller, Nicolas Brisebarre, Florent de Dinechin, 2018 .

Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications

Damien Stehlé, Huaxiong Wang, San Ling, 2013, Public Key Cryptography.

On the hardness of the NTRU problem

Damien Stehlé, Alice Pellet-Mary, D. Stehlé, 2021, IACR Cryptol. ePrint Arch..

On the Ring-LWE and Polynomial-LWE problems

Damien Stehlé, Miruna Rosca, Alexandre Wallet, 2018, IACR Cryptol. ePrint Arch..

Efficient Public Key Encryption Based on Ideal Lattices

Ron Steinfeld, Damien Stehlé, Keisuke Tanaka, 2009, ASIACRYPT.

Towards Practical GGM-Based PRF from (Module-)Learning-with-Rounding

Damien Stehlé, Chitchanok Chuengsatiansup, D. Stehlé, 2019, SAC.

Speeding-Up Lattice Reduction with Random Projections (Extended Abstract)

Damien Stehlé, Ali Akhavi, D. Stehlé, 2008, LATIN.

Floating-Point LLL: Theoretical and Practical Aspects

Damien Stehlé, D. Stehlé, 2010, The LLL Algorithm.

The Fused Multiply-Add Instruction

G. Melquiond, D. Stehlé, J. Muller, 2010 .

Gal's accurate tables method revisited

Damien Stehlé, Paul Zimmermann, P. Zimmermann, 2005, 17th IEEE Symposium on Computer Arithmetic (ARITH'05).

Evaluating Floating-Point Elementary Functions

Jean-Michel Muller, Nicolas Brisebarre, Florent de Dinechin, 2010 .

LLL on the Average

Damien Stehlé, Phong Q. Nguyen, D. Stehlé, 2006, ANTS.

Lattice-Based Group Signatures with Logarithmic Signature Size

Damien Stehlé, Adeline Langlois, Fabien Laguillaumie, 2013, ASIACRYPT.

Fully Homomophic Encryption over the Integers Revisited

Jung Hee Cheon, Damien Stehlé, J. Cheon, 2015, EUROCRYPT.

Worst Cases for the Exponential Function in the IEEE 754r decimal64 Format

Vincent Lefèvre, Damien Stehlé, Paul Zimmermann, 2008, Reliable Implementation of Real Number Algorithms.

Solving the Shortest Lattice Vector Problem in Time 22.465n

Damien Stehlé, Xavier Pujol, D. Stehlé, 2009, IACR Cryptol. ePrint Arch..

Searching worst cases of a one-variable function using lattice reduction

Vincent Lefèvre, Damien Stehlé, Paul Zimmermann, 2005, IEEE Transactions on Computers.

Analyzing Blockwise Lattice Algorithms Using Dynamical Systems

Damien Stehlé, Guillaume Hanrot, Xavier Pujol, 2011, CRYPTO.

A new view on HJLS and PSLQ: sums and projections of lattices

Damien Stehlé, Gilles Villard, Jingwei Chen, 2013, ISSAC '13.

Tuple lattice sieving

Damien Stehlé, Shi Bai, Thijs Laarhoven, 2016, IACR Cryptol. ePrint Arch..

Approx-SVP in Ideal Lattices with Pre-processing

Damien Stehlé, Guillaume Hanrot, Alice Pellet-Mary, 2019, IACR Cryptol. ePrint Arch..

Improved Security Proofs in Lattice-Based Cryptography: Using the Rényi Divergence Rather than the Statistical Distance

Ron Steinfeld, Damien Stehlé, Amin Sakzad, 2015, Journal of Cryptology.

Hardness of k-LWE and Applications in Traitor Tracing

Ron Steinfeld, Damien Stehlé, Duong Hieu Phan, 2014, Algorithmica.

Can Round-Optimal Lattice-Based Blind Signatures be Practical?

Damien Stehlé, Shweta Agrawal, Elena Kirshanova, 2021, IACR Cryptol. ePrint Arch..

CRYSTALS-Dilithium: A Lattice-Based Digital Signature Scheme

Damien Stehlé, Peter Schwabe, Eike Kiltz, 2018, IACR Trans. Cryptogr. Hardw. Embed. Syst..

GGHLite: More Efficient Multilinear Maps from Ideal Lattices

Ron Steinfeld, Damien Stehlé, Adeline Langlois, 2014, IACR Cryptol. ePrint Arch..

Fully Secure Functional Encryption for Inner Products, from Standard Assumptions

Damien Stehlé, Benoît Libert, Shweta Agrawal, 2016, CRYPTO.

Low-dimensional lattice basis reduction revisited

Damien Stehlé, Phong Q. Nguyen, D. Stehlé, 2004, TALG.

Practical, Round-Optimal Lattice-Based Blind Signatures

D. Stehlé, Shweta Agrawal, E. Kirshanova, 2022, CCS.

On Rejection Sampling in Lyubashevsky's Signature Scheme

Omar Fawzi, D. Stehlé, Alain Passelègue, 2022, IACR Cryptol. ePrint Arch..

Efficient Public Trace and Revoke from Standard Assumptions: Extended Abstract

Damien Stehlé, Duong Hieu Phan, Shweta Agrawal, 2017, CCS.

HAETAE: Shorter Lattice-Based Fiat-Shamir Signatures

T. Güneysu, J. Cheon, D. Stehlé, 2023, IACR Cryptol. ePrint Arch..

ModFalcon: Compact Signatures Based On Module-NTRU Lattices

Damien Stehlé, Keita Xagawa, Chitchanok Chuengsatiansup, 2020, IACR Cryptol. ePrint Arch..

A Binary Recursive Gcd Algorithm

Damien Stehlé, Paul Zimmermann, P. Zimmermann, 2004, ANTS.

MPSign: A Signature from Small-Secret Middle-Product Learning with Errors

Ron Steinfeld, Damien Stehlé, Zhenfei Zhang, 2020, IACR Cryptol. ePrint Arch..

Middle-Product Learning with Errors

Ron Steinfeld, Damien Stehlé, Amin Sakzad, 2017, CRYPTO.

Floating-point arithmetic

Jean-Michel Muller, Nicolas Brisebarre, Florent de Dinechin, 2023, Acta Numerica.

Damien Stehlé, Benoît Libert, Radu Titiu, 2018, Journal of Cryptology.

Measure-Rewind-Measure: Tighter Quantum Random Oracle Model Proofs for One-Way to Hiding and CCA Security

Ron Steinfeld, Damien Stehlé, Veronika Kuchta, 2020, EUROCRYPT.

Cryptanalysis of the CLT13 Multilinear Map

J. Cheon, D. Stehlé, Changmin Lee, 2018, Journal of Cryptology.

An LLL Algorithm for Module Lattices

Damien Stehlé, Changmin Lee, Alice Pellet-Mary, 2019, IACR Cryptol. ePrint Arch..

Worst-case to average-case reductions for module lattices

D. Stehlé, Adeline Langlois, 2014, Designs, Codes and Cryptography.

Short Bases of Lattices over Number Fields

Damien Stehlé, Claus Fieker, D. Stehlé, 2010, ANTS.

Round Optimal Blind Signatures: Short Signatures with Post-Quantum Blindness

J. Cheon, D. Stehlé, Shweta Agrawal, 2022, IACR Cryptol. ePrint Arch..

Decoding by Sampling: A Randomized Lattice Algorithm for Bounded Distance Decoding

Cong Ling, Damien Stehlé, Shuiyin Liu, 2010, IEEE Transactions on Information Theory.

Towards Practical and Round-Optimal Lattice-Based Threshold and Blind Signatures

Damien Stehlé, Shweta Agrawal, Anshu Yadav, 2021, IACR Cryptol. ePrint Arch..

On the smoothing parameter and last minimum of random orthogonal lattices

Damien Stehlé, Huyen Nguyen, Alexandre Wallet, 2020, IACR Cryptol. ePrint Arch..

On the smoothing parameter and last minimum of random orthogonal lattices

D. Stehlé, Alexandre Wallet, E. Kirshanova, 2020, Designs, Codes and Cryptography.

Computing an LLL-reduced Basis of the Orthogonal Latice

Damien Stehlé, Gilles Villard, Jingwei Chen, 2018, ISSAC.

Learning with Errors and Extrapolated Dihedral Cosets pdf

Damien Stehlé, Zvika Brakerski, Weiqiang Wen, 2017, Public Key Cryptography.

Lattice Reduction Algorithms

Damien Stehlé, D. Stehlé, 2017, ISSAC.

LLL reducing with the most significant bits

Damien Stehlé, Gilles Villard, Saruchi, 2014, ISSAC.

Perturbation Analysis of the QR factor R in the context of LLL lattice basis reduction

Damien Stehlé, Gilles Villard, Xiao-Wen Chang, 2012, Math. Comput..

Decoding by embedding: Correct decoding radius and DMT optimality

D. Stehlé, Cong Ling, Laura Luzzi, 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

An LLL-reduction algorithm with quasi-linear time complexity: extended abstract

G. Villard, D. Stehlé, A. Novocin, 2011, STOC '11.

Randomized Lattice Decoding pdf

Cong Ling, Damien Stehlé, Shuiyin Liu, 2010, ArXiv.

H-LLL: using householder inside LLL

Damien Stehlé, Gilles Villard, Ivan Morel, 2009, ISSAC '09.

From an LLL-reduced basis to another

Damien Stehlé, Gilles Villard, Ivan Morel, 2009, ACCA.

Rigorous and Efficient Short Lattice Vectors Enumeration

Damien Stehlé, Xavier Pujol, D. Stehlé, 2008, ASIACRYPT.

Worst-Case Hermite-Korkine-Zolotarev Reduced Lattice Bases

D. Stehlé, G. Hanrot, 2008, ArXiv.

Improved Analysis of Kannan's Shortest Lattice Vector Algorithm

D. Stehlé, G. Hanrot, 2007, CRYPTO.

Improved Reduction from the Bounded Distance Decoding Problem to the Unique Shortest Vector Problem in Lattices

Damien Stehlé, Shi Bai, Weiqiang Wen, 2016, IACR Cryptol. ePrint Arch..

Terminating BKZ

Damien Stehlé, Guillaume Hanrot, Xavier Pujol, 2011, IACR Cryptol. ePrint Arch..

Low-Dimensional Lattice Basis Reduction Revisited ( Extended Abstract )

Damien Stehlé, Phong Q. Nguyen, D. Stehlé, 2004 .

Randomized lattice decoding: Bridging the gap between lattice reduction and sphere decoding

Cong Ling, Damien Stehlé, Shuiyin Liu, 2010, 2010 IEEE International Symposium on Information Theory.

A Lattice-Based Traitor Tracing Scheme

Damien Stehlé, San Ling, D. Stehlé, 2012, IACR Cryptol. ePrint Arch..

On the Extremality of an 80-Dimensional Lattice

Damien Stehlé, Mark Watkins, M. Watkins, 2010, ANTS.

Fully Secure Functional Encryption for Inner Products, from Standard Assumptions

Benoît Libert, D. Stehlé, Shweta Agrawal, 2016, CRYPTO.