Publisher
Springer Nature Switzerland
Reference39 articles.
1. Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: 28th Annual ACM Symposium on Theory of Computing, Philadephia, PA, USA, 22–24 May pp. 99–108. ACM Press, (1996). https://doi.org/10.1145/237814.237838
2. Albrecht, M.R., Cid, C., Faugère, J.C., Fitzpatrick, R., Perret, L.: Algebraic algorithms for LWE problems. ACM Commun. Comput. Algebra 49(2), 62 (2015). https://doi.org/10.1145/2815111.2815158
3. Albrecht, M.R., Cid, C., Faugère, J.C., Perret, L.: Algebraic algorithms for LWE. Cryptology ePrint Archive, Report 2014/1018 (2014). https://eprint.iacr.org/2014/1018
4. Albrecht, M.R., Player, R., Scott, S.: On the concrete hardness of Learning with errors. J. Math. Cryptol. 9(3), 169–203 (2015). https://doi.org/10.1515/jmc-2015-0016
5. Alman, J., Williams, V.V.: A refined laser method and faster matrix multiplication. In: Marx, D. (ed.) 32nd Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 522–539. ACM-SIAM, Virtual Conference, 10–13 Jan (2021). https://doi.org/10.1137/1.9781611976465.32