( en | de | ru )

 

Disambiguation of "Ducas, Léo"

Author of the publication

copydeleteadd this publication to your clipboard
CRYSTALS - Kyber: A CCA-Secure Module-Lattice-Based KEM.

, , , , , , , , and . EuroS&P, page 353-367. IEEE, (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Georg Ducas

Miryam Ducasse

St{\'e}phane Ducasse

Plinio Léon Cantón

Juan Léon Villa

 

Other publications of authors with the same name

Short Stickelberger Class Relations and Application to Ideal-SVP., , and . EUROCRYPT (1), volume 10210 of Lecture Notes in Computer Science, page 324-348. (2017)Shortest Vector from Lattice Sieving: A Few Dimensions for Free.. EUROCRYPT (1), volume 10820 of Lecture Notes in Computer Science, page 125-145. Springer, (2018)Smoothing Codes and Lattices: Systematic Study and New Bounds., , , and . IACR Cryptol. ePrint Arch., (2022)New directions in nearest neighbor searching with applications to lattice sieving., , , and . SODA, page 10-24. SIAM, (2016)Hull Attacks on the Lattice Isomorphism Problem., and . Public Key Cryptography (1), volume 13940 of Lecture Notes in Computer Science, page 177-204. Springer, (2023)On the Lattice Isomorphism Problem, Quadratic Forms, Remarkable Lattices, and Cryptography., and . EUROCRYPT (3), volume 13277 of Lecture Notes in Computer Science, page 643-673. Springer, (2022)Does the Dual-Sieve Attack on Learning with Errors Even Work?, and . CRYPTO (3), volume 14083 of Lecture Notes in Computer Science, page 37-69. Springer, (2023)Faster Gaussian Lattice Sampling Using Lazy Floating-Point Arithmetic., and . ASIACRYPT, volume 7658 of Lecture Notes in Computer Science, page 415-432. Springer, (2012)An Algorithmic Reduction Theory for Binary Codes: LLL and more., , and . IACR Cryptol. ePrint Arch., (2020)Random Self-reducibility of Ideal-SVP via Arakelov Random Walks., , , and . CRYPTO (2), volume 12171 of Lecture Notes in Computer Science, page 243-273. Springer, (2020)