Author:
Doliskani Javad,Pereira Geovandro C. C. F.,Barreto Paulo S. L. M.
Publisher
Springer International Publishing
Reference40 articles.
1. Ajtai, M.: Generating hard instances of lattice problems. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, pp. 99–108. ACM (1996)
2. Lecture Notes in Computer Science;DJ Bernstein,2008
3. Bernstein, D.J., Lange, T.: Explicit formulas database (2007). http://www.hyperelliptic.org/EFD/index.html
4. Lecture Notes in Computer Science;J-F Biasse,2014
5. Charles, D.X., Lauter, K.E., Goren, E.Z.: Cryptographic hash functions from expander graphs. J. Cryptol. 22(1), 93–113 (2009)