Damien Stehlé

Weiqiang Wen

Proceedings of the Advances in Cryptology - ASIACRYPT 2018, 2018

2017

CRYSTALS - Dilithium: Digital Signatures from Module Lattices.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

CRYSTALS - Kyber: a CCA-secure module-lattice-based KEM.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

Efficient Public Trace and Revoke from Standard Assumptions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

Lattice Reduction Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017

Middle-Product Learning with Errors.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

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

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

Efficient Public Trace and Revoke from Standard Assumptions: Extended Abstract.

[BibT_eX]

[DOI]

Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 2017

2016

Tuple lattice sieving.

[BibT_eX]

[DOI]

Shi Bai

Thijs Laarhoven

LMS J. Comput. Math., 2016

Fully Homomorphic Encryption over the Integers Revisited.

[BibT_eX]

[DOI]

Jung Hee Cheon

IACR Cryptol. ePrint Arch., 2016

Faster LLL-type Reduction of Lattice Bases.

[BibT_eX]

[DOI]

Arnold Neumaier

Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

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

[BibT_eX]

[DOI]

Shi Bai

Weiqiang Wen

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Sanitization of FHE Ciphertexts.

[BibT_eX]

[DOI]

Léo Ducas

Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

Fully Secure Functional Encryption for Inner Products, from Standard Assumptions.

[BibT_eX]

[DOI]

Shweta Agrawal

Benoît Libert

Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

2015

Cryptanalysis of Gu's ideal multilinear map.

[BibT_eX]

[DOI]

Alice Pellet-Mary

IACR Cryptol. ePrint Arch., 2015

Fully Secure Functional Encryption for Inner Products, from Standard Assumptions.

[BibT_eX]

[DOI]

Benoît Libert

IACR Cryptol. ePrint Arch., 2015

Fully Homomophic Encryption over the Integers Revisited.

[BibT_eX]

[DOI]

Jung Hee Cheon

Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015

Cryptanalysis of the Multilinear Map over the Integers.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015

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

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2015 - 21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November 29, 2015

2014

Semantically Secure Lattice Codes for the Gaussian Wiretap Channel.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

LLL reducing with the most significant bits.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2014

GGHLite: More Efficient Multilinear Maps from Ideal Lattices.

[BibT_eX]

[DOI]

Adeline Langlois

Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014

Hardness of k-LWE and Applications in Traitor Tracing.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

2013

Decoding by Embedding: Correct Decoding Radius and DMT Optimality.

[BibT_eX]

[DOI]

Laura Luzzi

IEEE Trans. Inf. Theory, 2013

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

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

Classical hardness of learning with errors.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Theory of Computing Conference, 2013

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

[BibT_eX]

[DOI]

Proceedings of the Public-Key Cryptography - PKC 2013 - 16th International Conference on Practice and Theory in Public-Key Cryptography, Nara, Japan, February 26, 2013

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

[BibT_eX]

[DOI]

Jingwei Chen

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013

Lattice-Based Group Signatures with Logarithmic Signature Size.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2013, 2013

2012

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

[BibT_eX]

[DOI]

Xiao-Wen Chang

Math. Comput., 2012

Worst-Case to Average-Case Reductions for Module Lattices.

[BibT_eX]

[DOI]

Adeline Langlois

IACR Cryptol. ePrint Arch., 2012

2011

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

[BibT_eX]

[DOI]

Shuiyin Liu

IEEE Trans. Inf. Theory, 2011

Terminating BKZ.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

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

[BibT_eX]

[DOI]

Andrew Novocin

Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

Decoding by embedding: Correct decoding radius and DMT optimality.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

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

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2011, 2011

Analyzing Blockwise Lattice Algorithms Using Dynamical Systems.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

Algorithms for the Shortest and Closest Lattice Vector Problems.

[BibT_eX]

[DOI]

Proceedings of the Coding and Cryptology - Third International Workshop, 2011

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

[BibT_eX]

[DOI]

, 2011

2010

Floating-Point LLL: Theoretical and Practical Aspects.

[BibT_eX]

[DOI]

Proceedings of the LLL Algorithm - Survey and Applications, 2010

Analyse numérique et réduction de réseaux.

[BibT_eX]

[DOI]

Ivan Morel

Tech. Sci. Informatiques, 2010

Rigorous Perturbation Bounds of Some Matrix Factorizations.

[BibT_eX]

[DOI]

Xiao-Wen Chang

SIAM J. Matrix Anal. Appl., 2010

Randomized Lattice Decoding

[BibT_eX]

[DOI]

Shuiyin Liu

CoRR, 2010

Accelerating Lattice Reduction with FPGAs.

[BibT_eX]

[DOI]

Proceedings of the Progress in Cryptology, 2010

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

[BibT_eX]

[DOI]

Shuiyin Liu

Proceedings of the IEEE International Symposium on Information Theory, 2010

Faster Fully Homomorphic Encryption.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2010, 2010

On the Extremality of an 80-Dimensional Lattice.

[BibT_eX]

[DOI]

Mark Watkins

Proceedings of the Algorithmic Number Theory, 9th International Symposium, 2010

Short Bases of Lattices over Number Fields.

[BibT_eX]

[DOI]

Claus Fieker

Proceedings of the Algorithmic Number Theory, 9th International Symposium, 2010

Handbook of Floating-Point Arithmetic.

[BibT_eX]

[DOI]

Jean-Michel Muller

Nicolas Brisebarre

Florent de Dinechin

Claude-Pierre Jeannerod

Birkhäuser, ISBN: 978-0-8176-4704-9, 2010

2009

An LLL Algorithm with Quadratic Complexity.

[BibT_eX]

[DOI]

SIAM J. Comput., 2009

Solving the Shortest Lattice Vector Problem in Time 22.465n.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2009

H-LLL: using householder inside LLL.

[BibT_eX]

[DOI]

Ivan Morel

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009

Efficient Public Key Encryption Based on Ideal Lattices.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2009

2008

Worst-Case Hermite-Korkine-Zolotarev Reduced Lattice Bases

[BibT_eX]

[DOI]

CoRR, 2008

From an LLL-reduced basis to another.

[BibT_eX]

[DOI]

Ivan Morel

ACM Commun. Comput. Algebra, 2008

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

[BibT_eX]

[DOI]

Ali Akhavi

Proceedings of the LATIN 2008: Theoretical Informatics, 2008

Rigorous and Efficient Short Lattice Vectors Enumeration.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2008

2007

Improved Analysis of Kannan's Shortest Lattice Vector Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2007

Worst Cases of a Periodic Function for Large Arguments.

[BibT_eX]

[DOI]

Proceedings of the 18th IEEE Symposium on Computer Arithmetic (ARITH-18 2007), 2007

2006

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

[BibT_eX]

[DOI]

Vincent Lefèvre

Proceedings of the Reliable Implementation of Real Number Algorithms: Theory and Practice, 08.01., 2006

On the Randomness of Bits Generated by Sufficiently Smooth Functions.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Number Theory, 7th International Symposium, 2006

LLL on the Average.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Number Theory, 7th International Symposium, 2006

2005

Algorithmique de la réduction de réseaux et application à la recherche de pires cas pour l'arrondi defonctions mathématiques.

[BibT_eX]

[DOI]

PhD thesis, 2005

Searching Worst Cases of a One-Variable Function Using Lattice Reduction.

[BibT_eX]

[DOI]

Vincent Lefèvre

IEEE Trans. Computers, 2005

Floating-Point LLL Revisited.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2005

Gal's Accurate Tables Method Revisited.

[BibT_eX]

[DOI]

Proceedings of the 17th IEEE Symposium on Computer Arithmetic (ARITH-17 2005), 2005

2004

Breaking Littlewood's Cipher.

[BibT_eX]

[DOI]

Cryptologia, 2004

A Binary Recursive Gcd Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Number Theory, 6th International Symposium, 2004

Low-Dimensional Lattice Basis Reduction Revisited.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Number Theory, 6th International Symposium, 2004

2003

Worst Cases and Lattice Reduction.

[BibT_eX]

[DOI]

Vincent Lefèvre