Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Katharina Boudgoust"'
Publikováno v:
Designs, Codes and Cryptography. 90:1899-1936
Publikováno v:
Journal of Cryptology
Journal of Cryptology, 2023, 36 (1), pp.1. ⟨10.1007/s00145-022-09441-3⟩
Boudgoust, K, Jeudy, C, Roux-Langlois, A & Wen, W 2023, ' On the Hardness of Module Learning with Errors with Short Distributions ', J. Cryptol., vol. 36, no. 1 .
Journal of Cryptology, 2023, 36 (1), pp.1. ⟨10.1007/s00145-022-09441-3⟩
Boudgoust, K, Jeudy, C, Roux-Langlois, A & Wen, W 2023, ' On the Hardness of Module Learning with Errors with Short Distributions ', J. Cryptol., vol. 36, no. 1 .
International audience; The Module Learning With Errors (M-LWE) problem is a core computational assumption of lattice-based cryptography which offers an interesting trade-off between guaranteed security and concrete efficiency. The problem is paramet
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::95de972c3147c01ad31614bc1d03888a
https://hal.science/hal-04028217/file/2022-12-01_hardness_mlwe_with_short_distributions_eprint_revised.pdf
https://hal.science/hal-04028217/file/2022-12-01_hardness_mlwe_with_short_distributions_eprint_revised.pdf
Publikováno v:
CFAIL 2022
CFAIL 2022, Aug 2022, Santa Barbara / Hybrid, France
CFAIL 2022, Aug 2022, Santa Barbara / Hybrid, France
International audience; The Fiat-Shamir with Aborts paradigm of Lyubashevsky has given rise to efficient lattice-based signature schemes. One popular implementation is Dilithium which is a finalist in an ongoing standardization process run by the NIS
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::126eff3d179d8388557f65f8a1b89cf3
https://hal.science/hal-03819329/file/CFAIL2022-Signatures-5482.pdf
https://hal.science/hal-03819329/file/CFAIL2022-Signatures-5482.pdf
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031229114
Boudgoust, K, Jeudy, C, Roux-Langlois, A & Wen, W 2023, Entropic Hardness of Module-LWE from Module-NTRU . i INDOCRYPT 2022 . Springer, Lecture Notes in Computer Science, nr. 13774, s. 78-99 . https://doi.org/10.1007/978-3-031-22912-1_4
Indocrypt
Indocrypt, Dec 2022, Kolkata, India. pp.78-99, ⟨10.1007/978-3-031-22912-1_4⟩
Boudgoust, K, Jeudy, C, Roux-Langlois, A & Wen, W 2023, Entropic Hardness of Module-LWE from Module-NTRU . i INDOCRYPT 2022 . Springer, Lecture Notes in Computer Science, nr. 13774, s. 78-99 . https://doi.org/10.1007/978-3-031-22912-1_4
Indocrypt
Indocrypt, Dec 2022, Kolkata, India. pp.78-99, ⟨10.1007/978-3-031-22912-1_4⟩
International audience; The Module Learning With Errors problem (M-LWE) has gained popularity in recent years for its security-efficiency balance, and its hardness has been established for a number of variants. In this paper, we focus on proving the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::37698d62127eb89ed00c92afdcd0e220
https://doi.org/10.1007/978-3-031-22912-1_4
https://doi.org/10.1007/978-3-031-22912-1_4
Autor:
Katharina Boudgoust
Publikováno v:
Cryptography and Security [cs.CR]. Université Rennes 1, 2021. English. ⟨NNT : 2021REN1S064⟩
HAL
HAL
The main focus of this Ph.D thesis lies on the computational problem Learning With Errors (LWE). It is a core building block of lattice-based cryptography, which itself is among the most promising candidates to replace current cryptographic protocols
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::7e1ccf561269ab26a846eb4af6c6ca70
https://theses.hal.science/tel-03534254/document
https://theses.hal.science/tel-03534254/document
Publikováno v:
Lecture Notes in Computer Science book series
Topics in Cryptology – CT-RSA 2021
Topics in Cryptology – CT-RSA 2021, Cryptographers’ Track at the RSA Conference 2021, May 2021, San Francisco, United States. pp.503-526, ⟨10.1007/978-3-030-75539-3_21⟩
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Topics in Cryptology – CT-RSA 2021
CT-RSA 2021
Topics in Cryptology – CT-RSA 2021 ISBN: 9783030755386
CT-RSA
Topics in Cryptology – CT-RSA 2021
Topics in Cryptology – CT-RSA 2021, Cryptographers’ Track at the RSA Conference 2021, May 2021, San Francisco, United States. pp.503-526, ⟨10.1007/978-3-030-75539-3_21⟩
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Topics in Cryptology – CT-RSA 2021
CT-RSA 2021
Topics in Cryptology – CT-RSA 2021 ISBN: 9783030755386
CT-RSA
International audience; We prove that the Module Learning With Errors $\mathrm {M\text {-}LWE}$ problem with binary secrets and rank $d$ is at least as hard as the standard version of $\mathrm {M\text {-}LWE}$ with uniform secret and rank $k$, where
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::868f57d70db9d55498fa8f50ab31f878
https://hal.science/hal-03264223/file/20210303_eprint_binMLWE.pdf
https://hal.science/hal-03264223/file/20210303_eprint_binMLWE.pdf
Publikováno v:
Advances in Cryptology – ASIACRYPT 2020 ISBN: 9783030648336
ASIACRYPT (2)
Lecture Notes in Computer Science ASIACRYPT 2020
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Cryptology – ASIACRYPT 2020
ASIACRYPT (2)
Lecture Notes in Computer Science ASIACRYPT 2020
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Cryptology – ASIACRYPT 2020
We prove that the module learning with errors (\(\mathrm {M\text {-}LWE}\)) problem with arbitrary polynomial-sized modulus p is classically at least as hard as standard worst-case lattice problems, as long as the module rank d is not smaller than th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::78e3669e6c317972e867f13712a790ef
https://doi.org/10.1007/978-3-030-64834-3_10
https://doi.org/10.1007/978-3-030-64834-3_10
Autor:
Shi Bai, Zhenfei Zhang, Dipayan Das, Katharina Boudgoust, Adeline Roux-Langlois, Weiqiang Wen
Publikováno v:
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
Asiacrypt 2019-25th Annual International Conference on the Theory and Application of Cryptology and Information Security
Asiacrypt 2019-25th Annual International Conference on the Theory and Application of Cryptology and Information Security, Dec 2019, Kobe, Japan. ⟨10.1007/978-3-030-34578-5_3⟩
Lecture Notes in Computer Science ISBN: 9783030345778
ASIACRYPT (1)
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 I
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Cryptology – ASIACRYPT 2019
Asiacrypt 2019-25th Annual International Conference on the Theory and Application of Cryptology and Information Security
Asiacrypt 2019-25th Annual International Conference on the Theory and Application of Cryptology and Information Security, Dec 2019, Kobe, Japan. ⟨10.1007/978-3-030-34578-5_3⟩
Lecture Notes in Computer Science ISBN: 9783030345778
ASIACRYPT (1)
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 I
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Cryptology – ASIACRYPT 2019
At CRYPTO 2017, Rosca et al. introduce a new variant of the Learning With Errors (LWE) problem, called the Middle-Product LWE (\({\mathrm {MP}\text {-}\mathrm{LWE}}\)). The hardness of this new assumption is based on the hardness of the Polynomial LW
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3ef652fa90f2a4a611a15bd6d9dfb579
https://hal.science/hal-02880043/document
https://hal.science/hal-02880043/document