Author:
Kim Suhri,Lee Eunmin,Lee Joohee,Lee Minju,Noh Hyuna
Publisher
Springer Nature Singapore
Reference32 articles.
1. Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, pp. 99–108. STOC ’96, Association for Computing Machinery, New York, NY, USA (1996). https://doi.org/10.1145/237814.237838
2. Albrecht, M.R., Göpfert, F., Virdia, F., Wunderer, T.: Revisiting the expected cost of solving uSVP and applications to LWE. In: Takagi, T., Peyrin, T. (eds.) Advances in Cryptology – ASIACRYPT 2017. ASIACRYPT 2017. LNCS, vol. 10624, pp. 297–322. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-70694-8_11
3. Albrecht, M.R., Player, R., Scott, S.: On the concrete hardness of learning with errors. Cryptology ePrint Archive, Paper 2015/046 (2015). https://eprint.iacr.org/2015/046
4. Alkim, E., Ducas, L., Pöppelmann, T., Schwabe, P.: Post-quantum key exchange—a new hope. In: 25th USENIX Security Symposium (USENIX Security 16), pp. 327–343. USENIX Association, Austin, TX, August 2016. https://www.usenix.org/conference/usenixsecurity16/technical-sessions/presentation/alkim
5. Baan, H., et al.: Round5: Compact and Fast Post-quantum Public-Key Encryption, pp. 83–102, July 2019. https://doi.org/10.1007/978-3-030-25510-7_5