Solving the Shortest Lattice Vector Problem in Time 2^2.465n,
with Xavier Pujol. Submitted.
| |  
|
Perturbation Analysis of the
QR factor R in the Context of LLL Lattice Basis Reduction,
with Xiao-Wen Chang
and Gilles
Villard. Submitted.
| |
|
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.
To appear in the journal 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.
To be considered
as a preliminary version, 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.
© 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.
(an improved version
can be found on the webpage of the conference).
|
|
|
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.
(an improved version
can be found on the webpage of the conference).
|
|
|
![[Damien Stehle]](damien.png)
