Zobrazeno 1 - 10 of 34 pro vyhledávání: '"Léo Ducas"'
1
Akademický článek
CRYSTALS-Dilithium: A Lattice-Based Digital Signature Scheme
Autor: Léo Ducas, Eike Kiltz, Tancrède Lepoint, Vadim Lyubashevsky, Peter Schwabe, Gregor Seiler, Damien Stehlé
Publikováno v: Transactions on Cryptographic Hardware and Embedded Systems, Vol 2018, Iss 1 (2018)
In this paper, we present the lattice-based signature scheme Dilithium, which is a component of the CRYSTALS (Cryptographic Suite for Algebraic Lattices) suite that was submitted to NIST’s call for post-quantum cryptographic standards. The design o
Externí odkaz: https://doaj.org/article/2731b0926ae84880848203b06530fa0b
Zobrazit plný text záznamu
2
Estimating the hidden overheads in the BDGL lattice sieving algorithm
Autor: Léo Ducas
Publikováno v: Post-Quantum Cryptography ISBN: 9783031172335
The lattice sieving algorithm based on list-decoding of Becker-Ducas-Gama-Laarhoven (SODA 2016) is currently at the center of cryptanalysis cost estimates of candidate lattice schemes for post-quantum standardization. Yet, only an idealized version o
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c2114a6c6e61ef33091f4b2c1813a3f7
https://ir.cwi.nl/pub/32332
Zobrazit plný text záznamu
3
Smoothing Codes and Lattices: Systematic Study and New Bounds
Autor: Thomas Debris-Alazard, Léo Ducas, Nicolas Resch, Jean-Pierre Tillich
In this article we revisit smoothing bounds in parallel between lattices $and$ codes. Initially introduced by Micciancio and Regev, these bounds were instantiated with Gaussian distributions and were crucial for arguing the security of many lattice-b
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c07fcfd31c979f551f860beb80a6eb3c
http://arxiv.org/abs/2205.10552
Zobrazit plný text záznamu
4
Integral Matrix Gram Root and Lattice Gaussian Sampling Without Floats
Autor: Yang Yu, Léo Ducas, Steven D. Galbraith, Thomas Prest
Publikováno v: Advances in Cryptology – EUROCRYPT 2020
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Cryptology – EUROCRYPT 2020
Advances in Cryptology – EUROCRYPT 2020 ISBN: 9783030457235
EUROCRYPT (2)
Advances in Cryptology – EUROCRYPT 2020-39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, May 10–14, 2020, Proceedings, Part II
Many advanced lattice based cryptosystems require to sample lattice points from Gaussian distributions. One challenge for this task is that all current algorithms resort to floating-point arithmetic (FPA) at some point, which has numerous drawbacks i
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5a92175d023c7fa6c456f020254422a7
http://europepmc.org/articles/PMC7991737
Zobrazit plný text záznamu
5
Hawk: Module LIP Makes Lattice Signatures Fast, Compact and Simple
Autor: Léo Ducas, Eamonn W. Postlethwaite, Ludo N. Pulles, Wessel van Woerden
Publikováno v: Advances in Cryptology – ASIACRYPT 2022 ISBN: 9783031229718
We propose the signature scheme Hawk, a concrete instantiation of proposals to use the Lattice Isomorphism Problem (LIP) as a foundation for cryptography that focuses on simplicity. This simplicity stems from LIP, which allows the use of lattices suc
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2f4bc68e0ba4cb37ffda74ed9bb6b85d
https://doi.org/10.1007/978-3-031-22972-5_3
Zobrazit plný text záznamu
6
Random self-reducibility of ideal-svp via arakelov random walks
Autor: Koen de Boer, Benjamin Wesolowski, Léo Ducas, Alice Pellet-Mary
Publikováno v: CRYPTO 2020
CRYPTO 2020, Aug 2020, Santa Barbara, United States. ⟨10.1007/978-3-030-56880-1_9⟩
Advances in Cryptology – CRYPTO 2020 ISBN: 9783030568795
CRYPTO (2)
Advances in Cryptology – CRYPTO 2020-40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17–21, 2020, Proceedings, Part II
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Cryptology – CRYPTO 2020
International audience; Fixing a number field, the space of all ideal lattices, up to isometry, is naturally an Abelian group, called the Arakelov class group. This fact, well known to number theorists, has so far not been explicitly used in the lite
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bab5c58d032b80a953aa3b43d986217d
https://ir.cwi.nl/pub/30072
Zobrazit plný text záznamu
7
Advanced lattice sieving on GPUs, with Tensor Cores
Autor: Léo Ducas, Marc Stevens, Wessel P. J. van Woerden
Publikováno v: Advances in Cryptology – EUROCRYPT 2021-40th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, October 17–21, 2021, Proceedings, Part II
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Cryptology – EUROCRYPT 2021
Lecture Notes in Computer Science ISBN: 9783030778859
EUROCRYPT (2)
In this work, we study GPU implementations of various state-of-the-art sieving algorithms for lattices (Becker-Gama-Joux 2015, Becker-Ducas-Gama-Laarhoven 2016, Herold-Kirshanova 2017) inside the General Sieve Kernel (G6K, Albrecht et al. 2019). In p
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::31a9c3995292f54d14b4530b644353a2
https://ir.cwi.nl/pub/31045
Zobrazit plný text záznamu
8
Mildly Short Vectors in Cyclotomic Ideal Lattices in Quantum Polynomial Time
Autor: Léo Ducas, Ronald Cramer, Benjamin Wesolowski
Publikováno v: Journal of the ACM, 68(2)
Journal of the ACM
Journal of the ACM (JACM)
Journal of the ACM (JACM), 2021, 68 (2), pp.1-26. ⟨10.1145/3431725⟩
Journal of the ACM (JACM), Association for Computing Machinery, 2021, 68 (2), pp.1-26. ⟨10.1145/3431725⟩
In this article, we study the geometry of units and ideals of cyclotomic rings and derive an algorithm to find a mildly short vector in any given cyclotomic ideal lattice in quantum polynomial time, under some plausible number-theoretic assumptions.
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ae801b84b2a4ef4c2f1bc858e62c917e
http://hdl.handle.net/20.500.12278/113134
Zobrazit plný text záznamu
9
Learning Strikes Again: The Case of the DRS Signature Scheme
Autor: Léo Ducas, Yang Yu
Publikováno v: Journal of Cryptology, 34(1)
Advances in Cryptology – ASIACRYPT 2018-24th International Conference on the Theory and Application of Cryptology and Information Security, Brisbane, QLD, Australia, December 2–6, 2018, Proceedings, Part II
Lecture Notes in Computer Science ISBN: 9783030033286
ASIACRYPT (2)
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Cryptology – ASIACRYPT 2018
Lattice signature schemes generally require particular care when it comes to preventing secret information from leaking through signature transcript. For example, the Goldreich–Goldwasser–Halevi (GGH) signature scheme and the NTRUSign scheme were
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d9740df2f74fc5447e22c3d2fe038f15
https://doi.org/10.1007/s00145-020-09366-9
Zobrazit plný text záznamu
10
On the Quantum Complexity of the Continuous Hidden Subgroup Problem
Autor: Léo Ducas, Koen de Boer, Serge Fehr
Publikováno v: Advances in Cryptology – EUROCRYPT 2020 ISBN: 9783030457235
EUROCRYPT (2)
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Cryptology – EUROCRYPT 2020
EUROCRYPT 2020. Lecture Notes in Computer Science
Advances in Cryptology – EUROCRYPT 2020-39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, May 10–14, 2020, Proceedings, Part II
Advances in Cryptology – EUROCRYPT 2020
The Hidden Subgroup Problem (HSP) aims at capturing all problems that are susceptible to be solvable in quantum polynomial time following the blueprints of Shor’s celebrated algorithm. Successful solutions to this problems over various commutative
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a846b8c273d06a79e2f90e392470384b
https://ir.cwi.nl/pub/30234
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje