{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T01:04:30Z","timestamp":1759971870640,"version":"build-2065373602"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T00:00:00Z","timestamp":1755820800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T00:00:00Z","timestamp":1755820800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"DOI":"10.13039\/501100010274","name":"Daegu Gyeongbuk Institute of Science and Technology","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100010274","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptogr Eng"],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s13389-025-00380-w","type":"journal-article","created":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T08:51:41Z","timestamp":1755852701000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fast polynomial inversion algorithms for the post-quantum cryptography"],"prefix":"10.1007","volume":"15","author":[{"given":"Eun-Young","family":"Seo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Young-Sik","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jong-Seon","family":"No","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,22]]},"reference":[{"key":"380_CR1","unstructured":"Silverman, J.H.: Almost inverses and fast NTRU key creation,NTRU Tech Report, no. 014v1, Mar. 15, (1999)"},{"key":"380_CR2","unstructured":"Koc, C.K.: High-speed RSA implementation, RSA Laboratories, Bedford, MA, USA, Tech. Rep. TR201, (1994)"},{"key":"380_CR3","unstructured":"Chen, C., Danba, O., Hoffstein, J., Hulsing, A., Rijneveld, J., Schanck, J. M., Schwabe, P., Whyte, W., Zhang, Z., Saito, T., Yamakawa, T., Xagawa, K.: NTRU, Finalist of 3 round to the NIST PQC project, vol. 3, (2018)"},{"key":"380_CR4","unstructured":"Fouque, P.-A., Hoffstein, J., Kirchner, P., Lyubashevsky, V., Pornin, T., Prest, T., Ricosset, T., Seiler, G., Whyte, W., Zhang, Z.: Falcon: Fast-fourier lattice-based compact signatures over ntru, Finalist of 3 round to the NIST PQC project, vol. 3, (2018)"},{"key":"380_CR5","unstructured":"Aragon, N., Barreto, P., Bettaieb, S., Bidoux, L., Blazy, O., Deneuville, J., Gaborit, P., Gueron, S., Guneysu, T., Melchor, C.A., Misoczki, R., Persichetti, E., Sendrier, N., Tillich, J., Zemor, G., Vasseur, V., Ghosh, S., Richter-Brokmann, J.: BIKE: Bit flipping key encapsulation, Alternate Candidate of 3 round to the NIST PQC project"},{"key":"380_CR6","unstructured":"Bernstein, D.J., Brumley, B.B., Chen, M., Chuengsatiansup, C., Lange, T., Marotzke, A., Peng, B., Tuveri, N., Vredendaal, C.V., Yang, B.: NTRU Prime, Alternate Candidate of 3 round to the NIST PQC project"},{"key":"380_CR7","doi-asserted-by":"crossref","unstructured":"Brent, R.P., Rung, H.T.: A systolic algorithm for integer GCD computation, 1985 IEEE 7th Symposium on Computer Arithmetic (ARITH), Urbana, IL, USA, pp. 118-125, (1985)","DOI":"10.1109\/ARITH.1985.6158931"},{"issue":"4","key":"380_CR8","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0898-1221(87)90130-1","volume":"14","author":"AW Bojanczyk","year":"1987","unstructured":"Bojanczyk, A.W., Brent, R.P.: A systolic algorithm for extended GCD computation. Computers & Mathematics with Application 14(4), 233\u2013238 (1987)","journal-title":"Computers & Mathematics with Application"},{"issue":"5","key":"380_CR9","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1109\/LSP.2004.824053","volume":"11","author":"A Goupil","year":"2004","unstructured":"Goupil, A., Palicot, J.: Variation on Euclid\u2019s algorithm. IEEE Signal Processing Lett. 11(5), 457\u2013458 (2004)","journal-title":"IEEE Signal Processing Lett."},{"issue":"3","key":"380_CR10","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0890-5401(88)90024-7","volume":"78","author":"T Itoh","year":"1988","unstructured":"Itoh, T., Tsujii, S.: A fast algorithm for computing multiplicative inverse $$GF(s^m)$$ using normal bases. Inf. Comput. 78(3), 171\u2013177 (1988)","journal-title":"Inf. Comput."},{"issue":"4","key":"380_CR11","first-page":"367","volume":"62","author":"J Hu","year":"2015","unstructured":"Hu, J., Guo, W., Wei, J., Cheung, R.C.C.: Fast and generic inversion architectures over $$\\text{ GF }(2^ m) $$ using modified Itoh\u2013Tsujii algorithms. IEEE Trans. on Circuits and Systems II:Express Briefs 62(4), 367\u2013371 (2015)","journal-title":"IEEE Trans. on Circuits and Systems II:Express Briefs"},{"issue":"16","key":"380_CR12","doi-asserted-by":"publisher","first-page":"3105","DOI":"10.1002\/sec.1511","volume":"9","author":"S Vollala","year":"2016","unstructured":"Vollala, S., Geetha, K., Ramasubramanian, N.: Efficient modular exponential algorithms compatible with hardware implementation of public key cryptography. Secur. Commun. Netw. 9(16), 3105\u20133115 (2016)","journal-title":"Secur. Commun. Netw."},{"key":"380_CR13","doi-asserted-by":"publisher","first-page":"906","DOI":"10.1109\/ACCESS.2018.2885989","volume":"7","author":"Y Kim","year":"2018","unstructured":"Kim, Y.: Efficient algorithm for multi-nit Montgomery inverse using refined multiplicative inverse modular $$2^K$$. IEEE Access 7, 906\u2013918 (2018)","journal-title":"IEEE Access"},{"issue":"4","key":"380_CR14","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1109\/TC.2003.1190585","volume":"52","author":"C O\u2019Rourke","year":"2003","unstructured":"O\u2019Rourke, C., Sunar, B.: Achieving NTRU with Montgomery multiplication. IEEE Trans. Computers 52(4), 440\u2013448 (2003)","journal-title":"IEEE Trans. Computers"},{"key":"380_CR15","unstructured":"Ramasamy, R., Muniyandi, A.P.: Computing the modular inverse of a polynomial function over $$GF(2^P)$$ using bit wise operation. Int. J. Network Security 10(2), 107\u2013113 (2010)"},{"key":"380_CR16","doi-asserted-by":"crossref","unstructured":"Schroeppel, R., Orman, H., O\u2019Malley, S., Spatscheck, O.: Fast Key Exchange with Elliptic Curve Systems, Lecture Notes in Computer Science, vol 963. Springer, Berlin, Heidelberg CRYPT0\u201d 95, (1995)","DOI":"10.1007\/3-540-44750-4_4"},{"issue":"3","key":"380_CR17","doi-asserted-by":"publisher","first-page":"340","DOI":"10.46586\/tches.v2019.i3.340-398","volume":"2019","author":"DJ Bernstein","year":"2019","unstructured":"Bernstein, D.J., Yang, B.: Fast constant-time gcd computation and modular inversion. IACR Transactions on Cryptographic Hardware and Embedded Systems 2019(3), 340\u2013398 (2019)","journal-title":"IACR Transactions on Cryptographic Hardware and Embedded Systems"},{"key":"380_CR18","doi-asserted-by":"crossref","unstructured":"Venier, D., Cheung, R.C.C.: A Highly Parallel Constant-Time Almost-Inverse Algorithm, 2020 IEEE International Conference on Signal Processing, Communications and Computing(ICSPCC), Macau, China, pp. 1\u20136 (2020)","DOI":"10.1109\/ICSPCC50002.2020.9259505"},{"key":"380_CR19","doi-asserted-by":"crossref","unstructured":"Zhao, N., Su, S.: An improvement and a new design of algorithms for seeking the inverse of an NTRU polynomial, 2011 Seventh Int. Conf. Computational Intelligence and Security, Sanya, China, 891-895 (2011)","DOI":"10.1109\/CIS.2011.201"},{"key":"380_CR20","doi-asserted-by":"crossref","unstructured":"Gaithuru, J. N., Salleh, M., Mohamad, I.: NTRU inverse polynomial algorithm based on the LU decomposition method of matrix inversion, 2017 IEEE Conf. Application, Inf. and Network Security(AINS), Miri, Malaysia, (1-6), (2017)","DOI":"10.1109\/AINS.2017.8270415"},{"issue":"1","key":"380_CR21","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1093\/imamci\/18.1.83","volume":"18","author":"NP Karampetakis","year":"2001","unstructured":"Karampetakis, N.P., Tzekis, P.: On the computation of the generalized inverse of a polynomial matrix. IMA J. Math. Control. Inf. 18(1), 83\u201397 (2001)","journal-title":"IMA J. Math. Control. Inf."},{"issue":"90","key":"380_CR22","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1090\/S0025-5718-1965-0178586-1","volume":"19","author":"JW Cooley","year":"1965","unstructured":"Cooley, J.W., Tukey, J.W.: An algorithm for the machine calculation of complex Fourier series. Math. Comput. 19(90), 297\u2013301 (1965)","journal-title":"Math. Comput."},{"key":"380_CR23","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s13389-014-0084-8","volume":"4","author":"JW Bos","year":"2014","unstructured":"Bos, J.W.: Constant time modular inversion. J. Cryptographic Engineering 4, 275\u2013281 (2014)","journal-title":"J. Cryptographic Engineering"},{"key":"380_CR24","doi-asserted-by":"crossref","unstructured":"Barenghi, A., Pelosi, G.: A comprehensive analysis of constant-time polynomial inversion for post-quantum cryptosystems, in Proc. the 17th ACM Int. Conf. Computing Frontiers, 269-276, (2020)","DOI":"10.1145\/3387902.3397224"},{"key":"380_CR25","unstructured":"Nath, K., Sarkar, P.: Efficient inversion in (pseudo-)Mersenne prime order fields, IACR Cryptol. ePrint Arch. 985 (2018)"},{"key":"380_CR26","doi-asserted-by":"crossref","unstructured":"H\u00fclsing, A., Rijneveld, J., Schanck, J., Schwabe, P.: High-speed key encapsulation from NTRU, Proc. Cryptographic Hardware and Embedded Systems \u2013 CHES 2017, LNCS, vol. 10529, Springer-Verlag, 232-252, (2017)","DOI":"10.1007\/978-3-319-66787-4_12"},{"issue":"1","key":"380_CR27","first-page":"557","volume":"2022","author":"J Richter-Brockmann","year":"2022","unstructured":"Richter-Brockmann, J., Chen, M., Ghosh, S., G\u00fcneysu, T.: Racing BIKE: Improved polynomial multiplication and inversion in hardware. IACR Transactions on Cryptographic Hardware and Embedded Systems 2022(1), 557\u2013588 (2022)","journal-title":"IACR Transactions on Cryptographic Hardware and Embedded Systems"},{"key":"380_CR28","doi-asserted-by":"publisher","unstructured":"Drucker, N., Gueron, S., Kostic, D.: Fast polynomial inversion for post quantum QC-MDPC cryptography. In: Dolev, S., Kolesnikov, V., Lodha, S., Weiss, G. (eds.) CSCML 2020. LNCS, vol. 12161, pp. 110\u2013127. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-49785-9_8","DOI":"10.1007\/978-3-030-49785-9_8"},{"issue":"3","key":"380_CR29","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0890-5401(88)90024-7","volume":"78","author":"T Itoh","year":"1988","unstructured":"Itoh, T., Tsujii, S.: A fast algorithm for computing multiplicative inverses in GF(2m) using normal bases. Inf. Comput. 78(3), 171\u2013177 (1988). https:\/\/doi.org\/10.1016\/0890-5401(88)90024-7","journal-title":"Inf. Comput."},{"key":"380_CR30","unstructured":"Boothby, T.J., Bradshaw, R.W.: Bitslicing and the method of four Russians over larger finite fields (2009)"},{"key":"380_CR31","unstructured":"https:\/\/github.com\/eyseo00\/InversePolynomial\/"}],"container-title":["Journal of Cryptographic Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-025-00380-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13389-025-00380-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-025-00380-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T17:41:21Z","timestamp":1759945281000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13389-025-00380-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,22]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["380"],"URL":"https:\/\/doi.org\/10.1007\/s13389-025-00380-w","relation":{},"ISSN":["2190-8508","2190-8516"],"issn-type":[{"type":"print","value":"2190-8508"},{"type":"electronic","value":"2190-8516"}],"subject":[],"published":{"date-parts":[[2025,8,22]]},"assertion":[{"value":"14 October 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 August 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 August 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"16"}}