Secure Parameters for SWIFFT-Reference-Cited by-同舟云学术

Secure Parameters for SWIFFT

Published:2009 Issue: Volume: Page:1-17
ISSN:0302-9743
Container-title:Progress in Cryptology - INDOCRYPT 2009
language:
Short-container-title:

Author:

Buchmann Johannes,Lindner Richard

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-10628-6_1.pdf

Reference25 articles.

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

2. Arbitman, Y., Dogon, G., Lyubashevsky, V., Micciancio, D., Peikert, C., Rosen, A.: SWIFFTX: A proposal for the SHA-3 standard (2008), http://www.eecs.harvard.edu/~alon/PAPERS/lattices/swifftx.pdf

3. Buchmann, J., Döring, M., Lindner, R.: Efficiency improvement for NTRU. In: Alkassar, A., Siekmann, J. (eds.) SICHERHEIT 2008. Lecture Notes in Informatics, vol. 128, pp. 79–94. Bonner Köllen Verlag (2008)

4. Lecture Notes in Computer Science;J. Buchmann,2008

5. Lecture Notes in Computer Science;J. Buchmann,2006

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

1. State and societal responses to natural disasters in Latin American and Caribbean history;History Compass;2020-01-03

2. Improved Combinatorial Algorithms for the Inhomogeneous Short Integer Solution Problem;Journal of Cryptology;2018-10-15

3. A pseudorandom number generator based on worst-case lattice problems;Applicable Algebra in Engineering, Communication and Computing;2017-05-30

4. Towards Efficient Arithmetic for Lattice-Based Cryptography on Reconfigurable Hardware;Progress in Cryptology – LATINCRYPT 2012;2012

5. Random Sampling for Short Lattice Vectors on Graphics Cards;Cryptographic Hardware and Embedded Systems – CHES 2011;2011