{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T14:43:39Z","timestamp":1772808219166,"version":"3.50.1"},"reference-count":14,"publisher":"American Institute of Mathematical Sciences (AIMS)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AMC"],"published-print":{"date-parts":[[2021]]},"DOI":"10.3934\/amc.2020057","type":"journal-article","created":{"date-parts":[[2020,1,16]],"date-time":"2020-01-16T03:21:10Z","timestamp":1579144870000},"page":"257-266","source":"Crossref","is-referenced-by-count":3,"title":["Verifying solutions to LWE with implications for concrete security"],"prefix":"10.3934","volume":"15","author":[{"given":"Palash","family":"Sarkar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Subhadip","family":"Singha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"2321","reference":[{"key":"key-10.3934\/amc.2020057-1","unstructured":"

E. Alkim, R. Avanzi, J. Bos, L. Ducas, A. de la Piedra, T. Poppelmann, P. Schwabe, D. Stebila, M. R. Albrecht, E. Orsini, V. Osheter, K. G. Paterson, G. Peer and N. P. Smart, NewHope: Algorithm specifications and supporting documentation, (2019), https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/round-2-submissions<\/a>.<\/p>"},{"key":"key-10.3934\/amc.2020057-2","unstructured":"

E. Alkim, J. Bos, L. Ducas, P. Longa, I. Mironov, M. Naehrig, V. Nikolaenko, C. Peikert, A. Raghunathan and D. Stebila, FrodoKEM: Learning With Errors key encapsulation, (2019), https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/round-2-submissions<\/a>.<\/p>"},{"key":"key-10.3934\/amc.2020057-3","unstructured":"

R. Avanzi, J. Bos, L. Ducas, E. Kiltz, T. Lepoint, V. Lyubashevsky, J. M. Schanck, P. Schwabe, G. Seiler and D. Stehlé, CRYSTALS-Kyber: Algorithm specifications and supporting documentation, (2009), https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/round-2-submissions<\/a>.<\/p>"},{"key":"key-10.3934\/amc.2020057-4","unstructured":"

H. Baan, S. Bhattacharya, S. Fluhrer, O. Garcia-Morchon, T. Laarhoven, R. Player, R. Rietman, M.-J. O. Saarinen, L. Tolhuizen, J.-L. Torre-Arce and Z. F. Zhang, Round5: KEM and PKE based on (Ring) learning With rounding, (2019), https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/round-2-submissions<\/a>.<\/p>"},{"key":"key-10.3934\/amc.2020057-5","unstructured":"

D. J. Bernstein, Comparing proofs of security for lattice-based encryption, Cryptology ePrint Archive, Report 2019\/691, 2019, https:\/\/eprint.iacr.org\/2019\/691<\/a>.<\/p>"},{"key":"key-10.3934\/amc.2020057-6","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1996.0125"},{"key":"key-10.3934\/amc.2020057-7","doi-asserted-by":"crossref","unstructured":"

Z. Brakerski, A. Langlois, C. Peikert, O. Regev and D. Stehl\u00e9, Classical hardness of learning with errors (extended abstract), STOC'13\u2014Proceedings of the 2013 ACM Symposium on Theory of Computing, ACM, New York<\/i>, (2013), 575\u2013584.<\/p>","DOI":"10.1145\/2488608.2488680"},{"key":"key-10.3934\/amc.2020057-8","doi-asserted-by":"crossref","unstructured":"

S. Chatterjee, N. Koblitz, A. Menezes and P. Sarkar, Another look at tightness \u2161: Practical issues in cryptography, Mycrypt 2016: Paradigms in Cryptology-Mycrypt 2016, Malicious and Exploratory Cryptology<\/i>, (2016), 21\u201355.<\/p>","DOI":"10.1007\/978-3-319-61273-7_3"},{"key":"key-10.3934\/amc.2020057-9","unstructured":"

J.-P. D'Anvers, A. Karmakar, S. S. Roy and F. Vercauteren, SABER: Mod-LWR based KEM (round 2 submission), (2019), https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/round-2-submissions<\/a>.<\/p>"},{"key":"key-10.3934\/amc.2020057-10","unstructured":"

X. H. Lu, Y. M. Liu, D. D. Jia, H. Y. Xue, J. G. He, Z. F. Zhang, Z. Liu, H. Yang, B. Li and K. P. Wang, LAC: Lattice-based Cryptosystems, (2019), https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/round-2-submissions<\/a>.<\/p>"},{"key":"key-10.3934\/amc.2020057-11","doi-asserted-by":"crossref","unstructured":"

V. Lyubashevsky, C. Peikert and O. Regev, On ideal lattices and learning with errors over rings, J. ACM<\/i>, 60<\/b> (2013), Art. 43, 35 pp.<\/p>","DOI":"10.1145\/2535925"},{"key":"key-10.3934\/amc.2020057-12","doi-asserted-by":"crossref","unstructured":"

C. Peikert, Public-key cryptosystems from the worst-case shortest vector problem: Extended abstract, STOC'09\u2014Proceedings of the 2009 ACM International Symposium on Theory of Computing, ACM, New York<\/i>, (2009), 333\u2013342.<\/p>","DOI":"10.1145\/1536414.1536461"},{"key":"key-10.3934\/amc.2020057-13","doi-asserted-by":"crossref","unstructured":"

O. Regev, On lattices, learning with errors, random linear codes, and cryptography, J. ACM<\/i>, 56<\/b> (2009), Art. 34, 40 pp.<\/p>","DOI":"10.1145\/1568318.1568324"},{"key":"key-10.3934\/amc.2020057-14","unstructured":"

The Sage Developers, SageMath, the Sage Mathematics Software System (Version 7.5.1)<\/i>, 2019, https:\/\/www.sagemath.org<\/a>.<\/p>"}],"container-title":["Advances in Mathematics of Communications"],"original-title":[],"link":[{"URL":"http:\/\/aimsciences.org\/\/article\/doi\/10.3934\/amc.2020057?viewType=html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T10:04:55Z","timestamp":1772791495000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.aimsciences.org\/\/article\/doi\/10.3934\/amc.2020057"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021]]}},"URL":"https:\/\/doi.org\/10.3934\/amc.2020057","relation":{},"ISSN":["1930-5346","1930-5338"],"issn-type":[{"value":"1930-5346","type":"print"},{"value":"1930-5338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}