Analyzing Blockwise Lattice
Algorithms using Dynamical Systems, with Guillaume Hanrot and Xavier Pujol.
In the proceedings of
CRYPTO 2011.
© Springer-Verlag, 2011.
|
| 
|
Algorithms for the
Shortest and Closest Lattice Vector Problems, with Guillaume Hanrot
and Xavier Pujol. Invited
contribution for IWCC'11. ©
Springer-Verlag, 2011.
| |
|
Decoding by Embedding:
Correct Decoding Radius and DMT Optimality, with Laura Luzzi,
Shuiyin Liu and Cong Ling. Accepted to ISIT 2011.
| |
|
Making NTRU as secure as
worst-case problems over ideal lattices, with Ron Steinfeld.
In the proceedings of Eurocrypt
2011. © Springer-Verlag, 2011.
| |
|
An LLL-reduction algorithm with quasi-linear time complexity, with Andrew Novocin and Gilles Villard.
In the proceedings of STOC 2011.
|
|
|
Rigorous Perturbation
Bounds of Some Matrix Factorizations, with Xiao-Wen Chang.
In SIAM Journal on Matrix
Analysis and Applications (SIMAX), November 2010.
| |
|
Faster Fully Homomorphic
Encryption, with Ron
Steinfeld. In the proceedings
of Asiacrypt
2010. © Springer-Verlag, 2010.
| |
|
Accelerating Lattice
Reduction with FPGAs, with Jérémie
Detrey,
Guillaume Hanrot
and Xavier Pujol.
In the proceedings of LatinCrypt'10.
©
Springer-Verlag, 2010.
| |
|
A Complete Worst-Case Analysis of Kannan's Shortest Lattice Vector Algorithm,
with Guillaume Hanrot. Submitted.
| |
|
Short Bases of Lattices
over Number Fields, with Claus
Fieker.
In the proceedings of ANTS-IX. © Springer-Verlag, 2010.
| |
|
On the Extremality of an
80-Dimensional Lattice, with Mark Watkins.
In
the proceedings of ANTS-IX. ©
Springer-Verlag, 2010.
| |
|
Decoding by Sampling:
A Randomized Lattice Algorithm for Bounded Distance
Decoding,
with Shuiyin Liu and Cong Ling.
In IEEE Transactions on
Information Theory, 2011.
| |
|
Solving the Shortest Lattice
Vector Problem in Time 2^2.465n, with Xavier Pujol. IACR
eprint 2009/605.
| |
|
Perturbation Analysis
of the QR factor R in the Context of LLL Lattice Basis
Reduction,
with Xiao-Wen Chang and Gilles Villard.
To appear in Mathematics of Computation.
| |
|
Efficient Public-Key
Encryption Based on Ideal Lattices (Extended Abstract),
with
Ron
Steinfeld, Keisuke
Tanaka and Keita Xagawa. In the
proceedings
of ASIACRYPT
2009.
© Springer-Verlag, 2009.
| |
|
Handbook of Floating-Point Arithmetic,
with Jean-Michel
Muller, Nicolas
Brisebarre,
Florent
de
Dinechin,
Claude-Pierre
Jeannerod, Vincent
Lefèvre, Guillaume
Melquiond, Nathalie
Revol and Serge
Torres.
© Birkhauser, 2009.
|
| |
H-LLL: Using Householder
inside LLL, with Ivan Morel and Gilles
Villard.
In the proceedings of ISSAC 2009. © ACM,
2009.
| |
|
An LLL Algorithm with
Quadratic Complexity, with Phong Nguyen.
SIAM Journal on
Computing, 2009.
| |
|
Low-Dimensional Lattice Basis Reduction
Revisited (Full Version),
with
Phong Nguyen.
Transactions on Algorithms.
© ACM, 2009.
|
|
|
Analyse numérique et réduction de
réseaux (in French), with
Ivan Morel and
Gilles Villard.
TSI, 2010.
|
|
|
Rigorous and efficient short lattice vectors
enumeration,
with Xavier
Pujol.
In the proceedings of
ASIACRYPT
2008. © Springer-Verlag, 2008.
|
|
|
Worst-Case Hermite-Korkine-Zolotarev
Reduced Lattice Bases,
with Guillaume
Hanrot.
INRIA research report, 2008.
|
|
|
Speeding-up Lattice Reduction with
Random Projections,
with Ali
Akhavi.
In the proceedings
of LATIN'08. ©
Springer-Verlag, 2008.
|
|
|
Floating-point LLL: theoretical and
practical aspects. Survey for
the LLL+25 conference,
2007.
Chapter
of "The
LLL Algorithm, survey and applications". © Springer-Verlag,
2009.
|
|
|
Improved Analysis of Kannan's Shortest
Lattice Vector Algorithm,
with Guillaume
Hanrot.
In the proceedings of
CRYPTO 2007.
© Springer-Verlag, 2007.
|
|
|
Worst Cases of a Periodic Function for Large
Arguments,
with Guillaume
Hanrot, Vincent
Lefèvre and
Paul Zimmermann.
In the proceedings of
ARITH'18, 2007.
|
|
|
Worst Cases for the Exponential Function in the
IEEE 754r decimal64 Format,
with
Vincent
Lefèvre
and Paul Zimmermann.
In a special LNCS volume, following the Dagstuhl seminar
number 06021
(Reliable Implementation of
Real Number Algorithms: Theory and Practice), 2006.
© Springer-Verlag, 2008.
|
|
|
On the Randomness of Bits Generated by
Sufficiently Smooth Functions.
In the proceedings of the
ANTS-VII conference,
© Springer-Verlag, 2006.
|
|
|
LLL on the Average, with
Phong Nguyen.
In the proceedings of the
ANTS-VII conference,
© Springer-Verlag, 2006.
|
|
|
Floating-point LLL Revisited, with
Phong Nguyen.
In the proceedings of
Eurocrypt 2005,
© Springer-Verlag, 2005.
|
Gal's Accurate Tables Method Revisited,
with Paul Zimmermann.
In the proceedings of
Arith'17, 2005.
|
|
|
Searching Worst Cases of a One-Variable Function Using Lattice Reduction,
with Vincent Lefèvre
and Paul Zimmermann.
In IEEE
Transactions on Computers, march 2005.
|
Breaking Littlewood's Cipher. In
Cryptologia,
October 2004.
|
|
|
A Binary Recursive Gcd Algorithm, with
Paul Zimmermann.
In the proceedings of ANTS-VI,
© Springer-Verlag, 2004.
|
|
|
Low-Dimensional Lattice Basis Reduction
Revisited (Extended Abstract), with
Phong Nguyen.
In the proceedings of ANTS-VI,
© Springer-Verlag, 2004.
|
Worst Cases and Lattice Reduction, with Vincent Lefèvre
and Paul Zimmermann.
In the proceedings of ARITH'16,
2003.
|
|
|
![[Damien Stehle]](damien.png)