Zobrazeno 1 - 10 of 10 pro vyhledávání: '"Alexandre Wallet"'
1
SHORTER HASH-AND-SIGN LATTICE-BASED SIGNATURES
Autor: Thomas Espitau, Mehdi Tibouchi, Alexandre Wallet, Yang Yu
Publikováno v: Advances in Cryptology – CRYPTO 2022
Advances in Cryptology – CRYPTO 2022, Aug 2022, Santa Barbara, United States. pp.245-275, ⟨10.1007/978-3-031-15979-4_9⟩
Advances in Cryptology – CRYPTO 2022 ISBN: 9783031159787
International audience; Lattice-based digital signature schemes following the hash-and-signdesign paradigm of Gentry, Peikert and Vaikuntanathan (GPV) tend to offer anattractive level of efficiency, particularly when instantiated withstructured compa
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ea963a36b19e6b567b6548e861900794
https://hal.science/hal-03854905
Zobrazit plný text záznamu
2
One Bit is All It Takes: A Devastating Timing Attack on BLISS’s Non-Constant Time Sign Flips
Autor: Mehdi Tibouchi, Alexandre Wallet
Publikováno v: Journal of Mathematical Cryptology
Journal of Mathematical Cryptology, 2021, 15 (1), pp.131-142. ⟨10.1515/jmc-2020-0079⟩
Journal of Mathematical Cryptology, Vol 15, Iss 1, Pp 131-142 (2020)
As one of the most efficient lattice-based signature schemes, and one of the only ones to have seen deployment beyond an academic setting (e.g., as part of the VPN software suite strongSwan), BLISS has attracted a significant amount of attention in t
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e2b5605bc91e58e4e0f7dfd1b87d6ae8
https://doi.org/10.1515/jmc-2020-0079
Zobrazit plný text záznamu
4
ModFalcon: Compact Signatures Based On Module-NTRU Lattices
Autor: Thomas Prest, Chitchanok Chuengsatiansup, Keita Xagawa, Damien Stehlé, Alexandre Wallet
Publikováno v: AsiaCCS
ASIA-CCS
ASIA-CCS, 2020, Taipei, France. pp.853-866, ⟨10.1145/3320269.3384758⟩
Proceedings of the 15th ACM Asia Conference on Computer and Communications Security
International audience; Lattices lead to promising practical post-quantum digital signatures, combining asymptotic efficiency with strong theoretical security guarantees. However, tuning their parameters into practical instantiations is a delicate ta
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::35e8efe69959205d5398bd5d83ac3875
https://doi.org/10.1145/3320269.3384758
Zobrazit plný text záznamu
5
Key Recovery from Gram-Schmidt Norm Leakage in Hash-and-Sign Signatures over NTRU Lattices
Autor: Paul Kirchner, Mehdi Tibouchi, Alexandre Wallet, Pierre-Alain Fouque, Yang Yu
Publikováno v: Advances in Cryptology – EUROCRYPT 2020
Advances in Cryptology – EUROCRYPT 2020, May 2020, Zagreb, Croatia. pp.34-63, ⟨10.1007/978-3-030-45727-3_2⟩
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Cryptology – EUROCRYPT 2020
Advances in Cryptology – EUROCRYPT 2020 ISBN: 9783030457266
EUROCRYPT (3)
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 III
International audience; In this paper, we initiate the study of side-channel leakage in hash-and-sign lattice-based signatures, with particular emphasis on the two efficient implementations of the original GPV lattice-trapdoor paradigm for signatures
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fda5ca4745d8c30067d4ce82820a3b5d
https://inria.hal.science/hal-03854922
Zobrazit plný text záznamu
6
On the smoothing parameter and last minimum of random orthogonal lattices
Autor: Huyen Nguyen, Damien Stehlé, Alexandre Wallet, Elena Kirshanova
Publikováno v: Designs, Codes and Cryptography
Designs, Codes and Cryptography, 2020, 88 (5), pp.931-950. ⟨10.1007/s10623-020-00719-w⟩
Designs, Codes and Cryptography, Springer Verlag, 2020, 88 (5), pp.931-950. ⟨10.1007/s10623-020-00719-w⟩
Let $$X \in {{\mathbb Z}}^{n \times m}$$, with each entry independently and identically distributed from an integer Gaussian distribution. We consider the orthogonal lattice $$\varLambda ^\perp (X)$$ of X, i.e., the set of vectors $$\mathbf {v}\in {{
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::70f0849d197c266d300100ba9bd1741a
https://hal.science/hal-03011623
Zobrazit plný text záznamu
7
The point decomposition problem over hyperelliptic curves
Autor: Alexandre Wallet, Jean-Charles Faugère
Publikováno v: Designs, Codes and Cryptography
Designs, Codes and Cryptography, 2018, 86, pp.2279-2314. ⟨10.1007/s10623-017-0449-y⟩
Designs, Codes and Cryptography, Springer Verlag, In press, ⟨10.1007/s10623-017-0449-y⟩
International audience; Computing discrete logarithms is generically a difficult problem. For divisor class groups of curves defined over extension fields, a variant of the Index-Calculus called Decomposition attack is used, and it can be faster than
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d6d6a94de340e28d3360509b2c2593b7
https://doi.org/10.1007/s10623-017-0449-y
Zobrazit plný text záznamu
8
An LLL Algorithm for Module Lattices
Autor: Damien Stehlé, Alexandre Wallet, Alice Pellet-Mary, Changmin Lee
Publikováno v: Lecture Notes in Computer Science ISBN: 9783030346201
ASIACRYPT (2)
Advances in Cryptology – ASIACRYPT 2019-25th International Conference on the Theory and Application of Cryptology and Information Security, Kobe, Japan, December 8–12, 2019, Proceedings, Part II
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Cryptology – ASIACRYPT 2019
ASIACRYPT
ASIACRYPT, 2019, Kobe, Japan. pp.59-90, ⟨10.1007/978-3-030-34621-8_3⟩
The LLL algorithm takes as input a basis of a Euclidean lattice, and, within a polynomial number of operations, it outputs another basis of the same lattice but consisting of rather short vectors. We provide a generalization to R-modules contained in
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3e26cdc3a14b289d161d1bc073e86b73
https://doi.org/10.1007/978-3-030-34621-8_3
Zobrazit plný text záznamu
9
Improved Sieving on Algebraic Curves
Autor: Vanessa Vitse, Alexandre Wallet
Publikováno v: Progress in Cryptology--LATINCRYPT 2015
LATINCRYPT 2015, 4th International Conference on Cryptology and Information Security in Latin America
LATINCRYPT 2015, 4th International Conference on Cryptology and Information Security in Latin America, Aug 2015, Guadalajara, Mexico. pp.295-307, ⟨10.1007/978-3-319-22174-8_16⟩
Progress in Cryptology--LATINCRYPT 2015 ISBN: 9783319221731
LATINCRYPT
International audience; The best algorithms for discrete logarithms in Jacobians of algebraic curves of small genus are based on index calculus methods coupled with large prime variations. For hyperelliptic curves, relations are obtained by looking f
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::71226d1669541c442ea56a2eebe50d4a
https://hal.sorbonne-universite.fr/hal-01203086/file/SievingB.pdf
Zobrazit plný text záznamu
10
On the Ring-LWE and Polynomial-LWE Problems
Autor: Damien Stehlé, Miruna Rosca, Alexandre Wallet
Publikováno v: Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Cryptology – EUROCRYPT 2018
EUROCRYPT 2018-37th Annual International Conference on the Theory and Applications
EUROCRYPT 2018-37th Annual International Conference on the Theory and Applications, Apr 2018, Tel Aviv, Israel
Advances in Cryptology – EUROCRYPT 2018
Advances in Cryptology – EUROCRYPT 2018 ISBN: 9783319783802
EUROCRYPT (1)
The Ring Learning With Errors problem (\(\mathsf {RLWE}\)) comes in various forms. Vanilla \(\mathsf {RLWE}\) is the decision dual-\(\mathsf {RLWE}\) variant, consisting in distinguishing from uniform a distribution depending on a secret belonging to
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::941fb48fa5860e56f602bba9a290b105
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