Author:
Faller Sebastian H.,Baumer Pascal,Klooß Michael,Koch Alexander,Ottenhues Astrid,Raiber Markus
Publisher
Springer International Publishing
Reference36 articles.
1. Lecture Notes in Computer Science;S Agrawal,2010
2. Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: 28th ACM STOC, pp. 99–108. ACM Press (1996). https://doi.org/10.1145/237814.237838
3. Albrecht, M.R., Player, R., Scott, S.: On the concrete hardness of learning with errors. Cryptology ePrint Archive, Report 2015/046. https://eprint.iacr.org/2015/046
4. Alwen, J., Peikert, C.: Generating shorter bases for hard random lattices. Cryptology ePrint Archive, Report 2008/521. https://eprint.iacr.org/2008/521
5. Banaszczyk, W.: New bounds in some transference theorems in the geometry of numbers. Mathe. Annalen 296(1), 625–635 (1993). https://doi.org/10.1007/BF01445125