{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T11:21:51Z","timestamp":1763810511686},"reference-count":40,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"9","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2021,9,1]]},"DOI":"10.1587\/transfun.2020dmp0012","type":"journal-article","created":{"date-parts":[[2021,3,18]],"date-time":"2021-03-18T22:07:15Z","timestamp":1616105235000},"page":"1219-1234","source":"Crossref","is-referenced-by-count":1,"title":["A Compact Digital Signature Scheme Based on the Module-LWR Problem"],"prefix":"10.1587","volume":"E104.A","author":[{"given":"Hiroki","family":"OKADA","sequence":"first","affiliation":[{"name":"KDDI Research, Inc."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Atsushi","family":"TAKAYASU","sequence":"additional","affiliation":[{"name":"The University of Tokyo"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuhide","family":"FUKUSHIMA","sequence":"additional","affiliation":[{"name":"KDDI Research, Inc."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shinsaku","family":"KIYOMOTO","sequence":"additional","affiliation":[{"name":"KDDI Research, Inc."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tsuyoshi","family":"TAKAGI","sequence":"additional","affiliation":[{"name":"The University of Tokyo"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] H. Okada, A. Takayasu, K. Fukushima, S. Kiyomoto, and T. Takagi, \u201cA compact digital signature scheme based on the module-LWR problem,\u201d ICICS, eds. W. Meng, D. Gollmann, C.D. Jensen, and J. Zhou, pp.73-90, 2020. 10.1007\/978-3-030-61078-4_5","DOI":"10.1007\/978-3-030-61078-4_5"},{"key":"2","unstructured":"[2] National Institute of Standards and Technology, \u201cPost-quantum cryptography,\u201d 2019. https:\/\/csrc.nist.gov\/Projects\/Post-Quantum-Cryptography, Accessed: Feb. 27, 2019."},{"key":"3","unstructured":"[3] National Institute of Standards and Technology, \u201cPost-quantum cryptography \u2014 Round 2 submissions,\u201d 2020. https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/round-2-submissions, Accessed: April, 2020."},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] O. Regev, \u201cOn lattices, learning with errors, random linear codes, and cryptography,\u201d STOC&apos;05, pp.84-93, ACM, 2005. 10.1145\/1060590.1060603","DOI":"10.1145\/1060590.1060603"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] J. Bos, C. Costello, L. Ducas, I. Mironov, M. Naehrig, V. Nikolaenko, A. Raghunathan, and D. Stebila, \u201cFrodo: Take off the ring! practical, quantum-secure key exchange from LWE,\u201d CCS 2016, pp.1006-1018, 2016. 10.1145\/2976749.2978425","DOI":"10.1145\/2976749.2978425"},{"key":"6","unstructured":"[6] E. Alkim, L. Ducas, T. P\u00f6ppelmann, and P. Schwabe, \u201cPost-quantum key exchange \u2014 A New Hope,\u201d USENIX Security, pp.327-343, 2016."},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] J. Bos, L. Ducas, E. Kiltz, T. Lepoint, V. Lyubashevsky, J.M. Schanck, P. Schwabe, G. Seiler, and D. Stehle, \u201cCRYSTALS-Kyber: A CCA-secure module-lattice-based KEM,\u201d EuroS&amp;P 2018, pp.353-367, 2018. 10.1109\/eurosp.2018.00032","DOI":"10.1109\/EuroSP.2018.00032"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] H. Baan, S. Bhattacharya, S. Fluhrer, O. Garcia-Morchon, T. Laarhoven, R. Rietman, M.J.O. Saarinen, L. Tolhuizen, and Z. Zhang, \u201cRound5: Compact and fast post-quantum public-key encryption,\u201d Post-Quantum Cryptography 2019, eds. J. Ding and R. Steinwandt, pp.83-102, 2019. 10.1007\/978-3-030-25510-7_5","DOI":"10.1007\/978-3-030-25510-7_5"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] J.P. D&apos;Anvers, A. Karmakar, S.S. Roy, and F. Vercauteren, \u201cSaber: Module-LWR based key exchange, CPA-secure encryption and CCA-secure KEM,\u201d AFRICACRYPT 2018, pp.282-305, 2018. 10.1007\/978-3-319-89339-6_16","DOI":"10.1007\/978-3-319-89339-6_16"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] D.J. Bernstein, C. Chuengsatiansup, T. Lange, and C. van Vredendaal, \u201cNTRU prime: Reducing attack surface at low cost,\u201d Selected Areas in Cryptography \u2013 SAC 2017, eds. C. Adams and J. Camenisch, pp.235-260, 2018. 10.1007\/978-3-319-72565-9_12","DOI":"10.1007\/978-3-319-72565-9_12"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] A. H\u00fclsing, J. Rijneveld, J. Schanck, and P. Schwabe, \u201cHigh-speed key encapsulation from NTRU,\u201d Cryptographic Hardware and Embedded Systems \u2013 CHES 2017, eds. W. Fischer and N. Homma, pp.232-252, 2017. 10.1007\/978-3-319-66787-4_12","DOI":"10.1007\/978-3-319-66787-4_12"},{"key":"12","unstructured":"[12] E. Alkim, P.S.L.M. Barreto, N. Bindel, J. Kramer, P. Longa, and J.E. Ricardini, \u201cThe lattice-based digital signature scheme <i>q<\/i>TESLA,\u201d Cryptology ePrint Archive, Report 2019\/085, 2019. https:\/\/eprint.iacr.org\/2019\/085"},{"key":"13","doi-asserted-by":"publisher","unstructured":"[13] L. Ducas, E. Kiltz, T. Lepoint, V. Lyubashevsky, P. Schwabe, G. Seiler, and D. Stehl\u00e9, \u201cCRYSTALS-dilithium: A lattice-based digital signature scheme,\u201d TCHES, vol.2018, no.1, pp.238-268, Feb. 2018. 10.46586\/tches.v2018.i1.238-268","DOI":"10.46586\/tches.v2018.i1.238-268"},{"key":"14","unstructured":"[14] L. Ducas, T. Lepoint, V. Lyubashevsky, P. Schwabe, G. Seiler, and D. Stehl\u00e9, \u201cCRYSTALS-Dilithium: Algorithm specifications and supporting documentationn,\u201d Technical Report, National Institute of Standards and Technology, 2019. https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/round-2-submissions"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] E. Kiltz, V. Lyubashevsky, and C. Schaffner, \u201cA concrete treatment of Fiat-Shamir signatures in the quantum random-oracle model,\u201d Advances in Cryptology \u2013 EUROCRYPT 2018, eds. J.B. Nielsen and V. Rijmen, pp.552-586, 2018. 10.1007\/978-3-319-78372-7_18","DOI":"10.1007\/978-3-319-78372-7_18"},{"key":"16","unstructured":"[16] P.A. Fouque, J. Hoffstein, P. Kirchner, V. Lyubashevsky, T. Pornin, T. Prest, T. Ricosset, G. Seiler, W. Whyte, and Z. Zhang, \u201cFalcon: Fast-Fourier lattice-based compact signatures over NTRU,\u201d Technical Report, National Institute of Standards and Technology, 2019. https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/round-2-submissions"},{"key":"17","unstructured":"[17] National Institute of Standards and Technology, \u201cPost-quantum cryptography-Round 3 submissions,\u201d 2020. https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/round-3-submissions, Accessed: Sept. 2020."},{"key":"18","unstructured":"[18] D.J. Bernstein, T. Chou, T. Lange, I. von Maurich, R. Misoczki, R. Niederhagen, E. Persichetti, C. Peters, P. Schwabe, N. Sendrier, J. Szefer, and W. Wang, \u201cClassic mceliece: Conservative code-based cryptography,\u201d Technical Report, National Institute of Standards and Technology, 2019. https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/round-2-submissions"},{"key":"19","unstructured":"[19] J. Ding, M. Chen, A. Petzoldt, D. Schmidt, and B. Yang, \u201cRainbow-algorithm specification and documentation,\u201d Technical Report, National Institute of Standards and Technology, 2019. https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/round-2-submissions"},{"key":"20","doi-asserted-by":"crossref","unstructured":"[20] A. Banerjee, C. Peikert, and A. Rosen, \u201cPseudorandom functions and lattices,\u201d Advances in Cryptology-EUROCRYPT 2012, eds. D. Pointcheval and T. Johansson, pp.719-737, 2012. 10.1007\/978-3-642-29011-4_42","DOI":"10.1007\/978-3-642-29011-4_42"},{"key":"21","doi-asserted-by":"crossref","unstructured":"[21] A. Bogdanov, S. Guo, D. Masny, S. Richelson, and A. Rosen, \u201cOn the hardness of learning with rounding over small modulus,\u201d TCC, eds. E. Kushilevitz and T. Malkin, pp.209-224, 2016. 10.1007\/978-3-662-49096-9_9","DOI":"10.1007\/978-3-662-49096-9_9"},{"key":"22","doi-asserted-by":"crossref","unstructured":"[22] L. Chen, Z. Zhang, and Z. Zhang, \u201cOn the hardness of the computational ring-LWR problem and its applications,\u201d Advances in Cryptology \u2013 ASIACRYPT 2018, eds. T. Peyrin and S. Galbraith, pp.435-464, 2018. 10.1007\/978-3-030-03326-2_15","DOI":"10.1007\/978-3-030-03326-2_15"},{"key":"23","unstructured":"[23] M.V. Beirendonck, J.P. D&apos;Anvers, A. Karmakar, J. Balasch, and I. Verbauwhede, \u201cA side-channel resistant implementation of saber,\u201d Cryptology ePrint Archive, Report 2020\/733, 2020. https:\/\/eprint.iacr.org\/2020\/733"},{"key":"24","doi-asserted-by":"publisher","unstructured":"[24] T. Oder, T. Schneider, T. P\u00f6ppelmann, and T. G\u00fcneysu, \u201cPractical CCA2-secure and masked ring-LWE implementation,\u201d IACR Transaction Cryptographic Hardware and Embedded Systems, vol.2018, no.1, pp.142-174, Feb. 2018. 10.46586\/tches.v2018.i1.142-174","DOI":"10.46586\/tches.v2018.i1.142-174"},{"key":"25","doi-asserted-by":"publisher","unstructured":"[25] M. Bellare and P. Rogaway, \u201cThe security of triple encryption and a framework for code-based game-playing proofs,\u201d Advances in Cryptology \u2013 EUROCRYPT 2006, eds. S. Vaudenay, pp.409-426, 2006. 10.1007\/11761679_25","DOI":"10.1007\/11761679_25"},{"key":"26","doi-asserted-by":"publisher","unstructured":"[26] R. Beals, H. Buhrman, R. Cleve, M. Mosca, and R. de Wolf, \u201cQuantum lower bounds by polynomials,\u201d J. ACM, vol.48, no.4, pp.778-797, July 2001. 10.1145\/502090.502097","DOI":"10.1145\/502090.502097"},{"key":"27","doi-asserted-by":"crossref","unstructured":"[27] D. Boneh, \u00d6. Dagdelen, M. Fischlin, A. Lehmann, C. Schaffner, and M. Zhandry, \u201cRandom oracles in a quantum world,\u201d Advances in Cryptology \u2013 ASIACRYPT 2011, eds. D.H. Lee and X. Wang, pp.41-69, 2011. 10.1007\/978-3-642-25385-0_3","DOI":"10.1007\/978-3-642-25385-0_3"},{"key":"28","doi-asserted-by":"crossref","unstructured":"[28] M. Bellare and P. Rogaway, \u201cRandom oracles are practical: A paradigm for designing efficient protocols,\u201d CCS&apos;93, pp.62-73, ACM, 1993. 10.1145\/168588.168596","DOI":"10.1145\/168588.168596"},{"key":"29","doi-asserted-by":"crossref","unstructured":"[29] M. Zhandry, \u201cSecure identity-based encryption in the quantum random oracle model,\u201d Advances in Cryptology \u2013 CRYPTO 2012, eds. R. Safavi-Naini and R. Canetti, pp.758-775, 2012. 10.1007\/978-3-642-32009-5_44","DOI":"10.1007\/978-3-642-32009-5_44"},{"key":"30","doi-asserted-by":"publisher","unstructured":"[30] D. Pointcheval and J. Stern, \u201cSecurity arguments for digital signatures and blind signatures,\u201d J. Cryptol., vol.13, no.3, pp.361-396, June 2000. 10.1007\/s001450010003","DOI":"10.1007\/s001450010003"},{"key":"31","doi-asserted-by":"crossref","unstructured":"[31] M. Bellare and G. Neven, \u201cMulti-signatures in the plain public-key model and a general forking lemma,\u201d Proc. 13th ACM Conference on Computer and Communications Security, CCS&apos;06, pp.390-399, ACM, 2006. 10.1145\/1180405.1180453","DOI":"10.1145\/1180405.1180453"},{"key":"32","doi-asserted-by":"publisher","unstructured":"[32] V. Lyubashevsky, \u201cLattice signatures without trapdoors,\u201d Advances in Cryptology \u2013 EUROCRYPT 2012, eds. D. Pointcheval and T. Johansson, pp.738-755, 2012. 10.1007\/978-3-642-29011-4_43","DOI":"10.1007\/978-3-642-29011-4_43"},{"key":"33","doi-asserted-by":"publisher","unstructured":"[33] V. Lyubashevsky, \u201cFiat-Shamir with aborts: Applications to lattice and factoring-based signatures,\u201d Advances in Cryptology \u2013 ASIACRYPT 2009, eds. M. Matsui, pp.598-616, 2009. 10.1007\/978-3-642-10366-7_35","DOI":"10.1007\/978-3-642-10366-7_35"},{"key":"34","doi-asserted-by":"crossref","unstructured":"[34] M. Bellare, B. Poettering, and D. Stebila, \u201cFrom identification to signatures, tightly: A framework and generic transforms,\u201d Advances in Cryptology \u2013 ASIACRYPT 2016, eds. J.H. Cheon and T. Takagi, pp.435-464, 2016. 10.1007\/978-3-662-53890-6_15","DOI":"10.1007\/978-3-662-53890-6_15"},{"key":"35","doi-asserted-by":"crossref","unstructured":"[35] M.R. Albrecht, B.R. Curtis, A. Deo, A. Davidson, R. Player, E.W. Postlethwaite, F. Virdia, and T. Wunderer, \u201cEstimate all the {LWE, NTRU} schemes!,\u201d SCN 2018, pp.351-367, 2018. 10.1007\/978-3-319-98113-0_19","DOI":"10.1007\/978-3-319-98113-0_19"},{"key":"36","unstructured":"[36] L. Ducas, T. Lepoint, V. Lyubashevsky, P. Schwabe, G. Seiler, and D. Stehl\u00e9, \u201cCRYSTALS-Dilithium: Algorithm specifications and supporting documentationn,\u201d Technical Report, National Institute of Standards and Technology, 2020. https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/round-3-submissions"},{"key":"37","unstructured":"[37] P. Fouque, J. Hoffstein, P. Kirchner, V. Lyubashevsky, T. Pornin, T. Prest, T. Ricosset, G. Seiler, W. Whyte, and Z. Zhang, \u201cFalcon: Fast-Fourier lattice-based compact signatures over NTRU-Specifications v1.2. 2020,\u201d Technical Report, National Institute of Standards and Technology, 2020. https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/round-3-submissions"},{"key":"38","unstructured":"[38] T. Pornin, \u201cNew efficient, constant-time implementations of Falcon,\u201d Cryptology ePrint Archive, Report 2019\/893, 2019. https:\/\/eprint.iacr.org\/2019\/893"},{"key":"39","doi-asserted-by":"crossref","unstructured":"[39] P. Kirchner and P.A. Fouque, \u201cRevisiting lattice attacks on overstretched NTRU parameters,\u201d Advances in Cryptology \u2013 EUROCRYPT 2017, eds. J.S. Coron and J.B. Nielsen, pp.3-26, 2017. 10.1007\/978-3-319-56620-7_1","DOI":"10.1007\/978-3-319-56620-7_1"},{"key":"40","doi-asserted-by":"crossref","unstructured":"[40] E. Alkim, N. Bindel, J. Buchmann, \u00d6. Dagdelen, E. Eaton, G. Gutoski, J. Kr\u00e4mer, and F. Pawlega, \u201cRevisiting TESLA in the quantum random oracle model,\u201d Post-Quantum Cryptography 2017, eds. T. Lange and T. Takagi, pp.143-162, 2017. 10.1007\/978-3-319-59879-6_9","DOI":"10.1007\/978-3-319-59879-6_9"}],"container-title":["IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E104.A\/9\/E104.A_2020DMP0012\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,4]],"date-time":"2021-09-04T03:26:09Z","timestamp":1630725969000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E104.A\/9\/E104.A_2020DMP0012\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,1]]},"references-count":40,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2021]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2020dmp0012","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9,1]]},"article-number":"2020DMP0012"}}