Making NTRU as Secure as Worst-Case Problems over Ideal Lattices-Reference-Cited by-同舟云学术

Making NTRU as Secure as Worst-Case Problems over Ideal Lattices

Published:2011 Issue: Volume: Page:27-47
ISSN:0302-9743
Container-title:Advances in Cryptology – EUROCRYPT 2011
language:
Short-container-title:

Author:

Stehlé Damien,Steinfeld Ron

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-20465-4_4.pdf

Reference35 articles.

1. Lecture Notes in Computer Science;S. Agrawal,2010

2. Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: Proceedings of the 28th Symposium on the Theory of Computing (STOC 1996), pp. 99–108. ACM, New York (1996)

3. Lecture Notes in Computer Science;B. Applebaum,2009

4. Banks, W.D., Shparlinski, I.E.: Distribution of inverses in polynomial rings. Indagationes Mathematicae 12(3), 303–315 (2001)

5. Lecture Notes in Computer Science;D. Cash,2010

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

1. An algebraic algorithm for breaking NTRU with multiple keys;Designs, Codes and Cryptography;2024-08-10

2. A security-enhanced authentication scheme for quantum-key-distribution (QKD) enabled Internet of vehicles in multi-cloud environment;Vehicular Communications;2024-08

3. Secure Messaging Application Development: Based on Post-Quantum Algorithms CSIDH, Falcon, and AES Symmetric Key Cryptosystem;Programming and Computer Software;2024-07-30

4. Good Gottesman-Kitaev-Preskill codes from the NTRU cryptosystem;Quantum;2024-07-04

5. Publicly Verifiable Secure Multi-Party Computation Framework Based on Bulletin Board;IEEE Transactions on Services Computing;2024-07