Publisher
Springer Science and Business Media LLC
Reference14 articles.
1. Blake, I.F., Theo, G.: On the complexity of the discrete logarithm and Diffie–Hellman problems. J. Complex. 20(2), 148–170 (2004)
2. McEliece, Robert J.: A public-key cryptosystem based on algebraic. Coding Theory DSN Progress Report 44, 114–116 (1978)
3. Dinh, H., Moore, C., Russell, A.: McEliece and Niederreiter cryptosystems that resist quantum Fourier sampling attacks Rogaway. In: Advances in Cryptology–CRYPTO 2011. Lecture Notes in Computer Science, 6841. Springer, Berlin, pp. 761–779 (2011)
4. Ajtai, M.: Generating hard instances of lattice problems. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing. ACM, Philadelphia, pp. 99–108 (1996)
5. Ajtai, M.: The shortest vector problem in L2 is NP-hard for randomized reductions. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing. ACM, Dallas, pp. 10–19 (1998)