Author:
Lyubashevsky Vadim,Micciancio Daniele,Peikert Chris,Rosen Alon
Publisher
Springer Berlin Heidelberg
Reference30 articles.
1. Ajtai, M.: Generating hard instances of lattice problems. In: STOC, pp. 99–108 (1996)
2. Lecture Notes in Computer Science;T. Baritaud,1993
3. Bentahar, K., Page, D., Silverman, J., Saarinen, M., Smart, N.: Lash. Technical report, 2nd NIST Cryptographic Hash Function Workshop (2006)
4. Lecture Notes in Computer Science;E. Biham,2005
5. Blum, A., Kalai, A., Wasserman, H.: Noise-tolerant learning, the parity problem, and the statistical query model. Journal of the ACM 50(4), 506–519 (2003)
Cited by
131 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Discriminants of Number Fields;Jahresbericht der Deutschen Mathematiker-Vereinigung;2024-09
2. Towards Post-Quantum Verifiable Credentials;Proceedings of the 19th International Conference on Availability, Reliability and Security;2024-07-30
3. TOPCOAT: towards practical two-party Crystals-Dilithium;Discover Computing;2024-07-10
4. HMNTT: A Highly Efficient MDC-NTT Architecture for Privacy-preserving Applications;Proceedings of the Great Lakes Symposium on VLSI 2024;2024-06-12
5. Unified-pipelined NTT Architecture for Polynomial Multiplication in Lattice-based Cryptosystems;2024 IEEE International Symposium on Circuits and Systems (ISCAS);2024-05-19