Filtrer vos résultats
- 8
- 6
- 1
- 1
- 8
- 1
- 3
- 2
- 1
- 1
- 8
- 7
- 3
- 2
- 2
- 1
- 1
- 1
- 8
- 5
- 3
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
8 résultats
|
|
|
triés par
|
|
|
On the Hardness of Module Learning with Errors with Short DistributionsJournal of Cryptology, 2023, 36 (1), pp.1-72. ⟨10.1007/s00145-022-09441-3⟩
Article dans une revue
hal-04028217v1
|
||
|
|
Entropic Hardness of Module-LWE from Module-NTRUIndocrypt, Dec 2022, Kolkata, India. pp.78 - 99, ⟨10.1007/978-3-031-22912-1_4⟩
Communication dans un congrès
hal-04028179v1
|
||
|
|
Some Easy Instances of Ideal-SVP and Implications on the Partial Vandermonde Knapsack ProblemCRYPTO 2022, International Association for Cryptologic Research (IACR), Aug 2022, Santa Barbara / Hybrid, United States. ⟨10.1007/978-3-031-15979-4_17⟩
Communication dans un congrès
hal-03789519v1
|
||
|
|
Towards Classical Hardness of Module-LWE: The Linear Rank CaseAsiacrypt 2020 - 26th Annual International Conference on the Theory and Application of Cryptology and Information Security, Dec 2020, Virtual, France
Communication dans un congrès
hal-03038053v1
|
||
|
|
Overfull: Too Large Aggregate Signatures Based on LatticesCFAIL 2022, Aug 2022, Santa Barbara / Hybrid, France
Communication dans un congrès
hal-03819329v1
|
||
|
|
Theoretical hardness of algebraically structured learning with errorsCryptography and Security [cs.CR]. Université Rennes 1, 2021. English. ⟨NNT : 2021REN1S064⟩
Thèse
tel-03534254v1
|
||
|
|
Middle-Product Learning with Rounding Problem and its ApplicationsAsiacrypt 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⟩
Communication dans un congrès
hal-02880043v1
|
||
|
|
On the Hardness of Module-LWE with Binary SecretTopics 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⟩
Communication dans un congrès
hal-03264223v1
|