Towards Classical Hardness of Module-LWE: The Linear Rank Case-Reference-Cited by-同舟云学术

Towards Classical Hardness of Module-LWE: The Linear Rank Case

Published:2020 Issue: Volume: Page:289-317
ISSN:0302-9743
Container-title:Advances in Cryptology – ASIACRYPT 2020
language:
Short-container-title:

Author:

Boudgoust Katharina,Jeudy Corentin,Roux-Langlois Adeline,Wen Weiqiang

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-030-64834-3_10

Reference39 articles.

1. Lecture Notes in Computer Science;MR Albrecht,2017

2. Lecture Notes in Computer Science;L Babai,1985

3. Banaszczyk, W.: New bounds in some transference theorems in the geometry of numbers. Math. Ann. 296(4), 625–635 (1993)

4. Bos, J.W.: CRYSTALS - kyber: a CCA-secure module-lattice-based KEM. In: 2018 IEEE European Symposium on Security and Privacy, EuroS&P 2018, London, United Kingdom, 24–26 April 2018, pp. 353–367 (2018)

5. Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled) fully homomorphic encryption without bootstrapping. In: Innovations in Theoretical Computer Science 2012, Cambridge, MA, USA, 8–10 January 2012, pp. 309–325 (2012)

Cited by 17 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Hardness of Entropic Module-LWE;Theoretical Computer Science;2024-06

2. Hardness of (M)LWE with semi-uniform seeds;Theoretical Computer Science;2024-05

3. Hardness of Module-LWE with Semiuniform Seeds from Module-NTRU;IET Information Security;2023-10-23

4. Hardness of (Semiuniform) MLWE with Short Distributions Using the Rényi Divergence;IET Information Security;2023-10-23

5. Overfull: Too Large Aggregate Signatures Based on Lattices;The Computer Journal;2023-03-17