{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T14:47:23Z","timestamp":1772808443904,"version":"3.50.1"},"reference-count":8,"publisher":"American Institute of Mathematical Sciences (AIMS)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AMC"],"published-print":{"date-parts":[[2020]]},"DOI":"10.3934\/amc.2020030","type":"journal-article","created":{"date-parts":[[2019,9,12]],"date-time":"2019-09-12T04:42:21Z","timestamp":1568263341000},"page":"573-577","source":"Crossref","is-referenced-by-count":1,"title":["Giophantus distinguishing attack is a low dimensional learning with errors problem"],"prefix":"10.3934","volume":"14","author":[{"given":"Jintai","family":"Ding","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joshua","family":"Deaton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kurt","family":"Schmidt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"2321","reference":[{"key":"key-10.3934\/amc.2020030-1","unstructured":"<p>K. Akiyama, Y. Goto, S. Okumura, T. Takagi, K. Nuida, G. Hanaoka, H. Shimizu and Y. Ikematsu, A public-key encryption scheme based on non-linear indeterminate equations (giophantus), <i>Cryptology ePrint Archive, Report 2017\/1241<\/i>, (2017). Available from: <a href=\"https:\/\/eprint.iacr.org\/2017\/1241\" target=\"_blank\">https:\/\/eprint.iacr.org\/2017\/1241<\/a>.<\/p>"},{"key":"key-10.3934\/amc.2020030-2","unstructured":"<p>K. Akiyama, Indeterminate equation public-key cryptosystem \"$Giophantus$\", <i>First PQC Standardization Conference<\/i>, Fort Lauderdale FL. USA, (2018). Available from: <a href=\"https:\/\/csrc.nist.gov\/CSRC\/media\/Presentations\/Giophantus\/images-media\/Giophantus-April2018.pdf\" target=\"_blank\">https:\/\/csrc.nist.gov\/CSRC\/media\/Presentations\/Giophantus\/images-media\/Giophantus-April2018.pdf<\/a>.<\/p>"},{"key":"key-10.3934\/amc.2020030-3","doi-asserted-by":"crossref","unstructured":"<p>M. R. Albrecht, R. Fitzpatrick and F. G&#246;pfert, On the efficacy of solving LWE by reduction to unique-SVP, <i>Information Security and Cryptology \u2013 ICISC<\/i>, (2013), 293\u2013310. Available from: <a href=\"https:\/\/eprint.iacr.org\/2013\/602\" target=\"_blank\">https:\/\/eprint.iacr.org\/2013\/602<\/a>.<\/p>","DOI":"10.1007\/978-3-319-12160-4_18"},{"key":"key-10.3934\/amc.2020030-4","unstructured":"<p>W. Beullens, W. Castryck and F. Vercauteren, IND-CPA attack on Giophantus, (2018), Available from: <a href=\"https:\/\/csrc.nist.gov\/CSRC\/media\/Projects\/Post-Quantum-Cryptography\/documents\/round-1\/official-comments\/Giophantus-official-comment.pdf\" target=\"_blank\">https:\/\/csrc.nist.gov\/CSRC\/media\/Projects\/Post-Quantum-Cryptography\/documents\/round-1\/official-comments\/Giophantus-official-comment.pdf<\/a>.<\/p>"},{"key":"key-10.3934\/amc.2020030-5","doi-asserted-by":"crossref","unstructured":"<p>J. T. Ding, S. Alsayigh, R. V. Saraswathy, S. Fluhrer and X. D. Lin, Leakage of Signal function with reused keys in RLWE key exchange, <i>2017 IEEE International Conference on Communications (ICC)<\/i>, (2017). Available from: <a href=\"https:\/\/eprint.iacr.org\/2016\/1176\" target=\"_blank\">https:\/\/eprint.iacr.org\/2016\/1176<\/a>.<\/p>","DOI":"10.1109\/ICC.2017.7996806"},{"key":"key-10.3934\/amc.2020030-6","unstructured":"<p>S. Fluhrer, Cryptanalysis of ring-LWE based key exchange with key share reuse, 2016, Available from: <a href=\"https:\/\/eprint.iacr.org\/2016\/085\" target=\"_blank\">https:\/\/eprint.iacr.org\/2016\/085<\/a>.<\/p>"},{"key":"key-10.3934\/amc.2020030-7","unstructured":"<p>P. Nguyen, Giophantus and *LWR-based submissions, 2018, Available from: <a href=\"https:\/\/csrc.nist.gov\/CSRC\/media\/Projects\/Post-Quantum-Cryptography\/documents\/round-1\/official-comments\/Giophantus-official-comment.pdf\" target=\"_blank\">https:\/\/csrc.nist.gov\/CSRC\/media\/Projects\/Post-Quantum-Cryptography\/documents\/round-1\/official-comments\/Giophantus-official-comment.pdf<\/a>.<\/p>"},{"key":"key-10.3934\/amc.2020030-8","doi-asserted-by":"crossref","unstructured":"<p>O. Regev, On lattices, learning with errors, random linear codes, and cryptography, <i>STOC'05: Proceedings of the Annual ACM Symposium on Theory of Computing<\/i>, (2005), 84\u201393.<\/p>","DOI":"10.1145\/1060590.1060603"}],"container-title":["Advances in Mathematics of Communications"],"original-title":[],"link":[{"URL":"https:\/\/www.aimsciences.org\/article\/exportPdf?id=21e23770-7ce5-43bf-b8b9-f109ed67175f","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T10:05:34Z","timestamp":1772791534000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.aimsciences.org\/\/article\/doi\/10.3934\/amc.2020030"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":8,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020]]}},"URL":"https:\/\/doi.org\/10.3934\/amc.2020030","relation":{},"ISSN":["1930-5346","1930-5338"],"issn-type":[{"value":"1930-5346","type":"print"},{"value":"1930-5338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}