{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:27:09Z","timestamp":1743089229116,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031803109"},{"type":"electronic","value":"9783031803116"}],"license":[{"start":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T00:00:00Z","timestamp":1733961600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T00:00:00Z","timestamp":1733961600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-80311-6_12","type":"book-chapter","created":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T00:30:53Z","timestamp":1733963453000},"page":"237-256","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Polynomial Inversion Algorithms in\u00a0Constant Time for\u00a0Post-Quantum Cryptography"],"prefix":"10.1007","author":[{"given":"Abhraneel","family":"Dutta","sequence":"first","affiliation":[]},{"given":"Emrah","family":"Karagoz","sequence":"additional","affiliation":[]},{"given":"Edoardo","family":"Persichetti","sequence":"additional","affiliation":[]},{"given":"Pakize","family":"Sanal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,12]]},"reference":[{"key":"12_CR1","unstructured":"Aragon, N., et\u00a0al.: BIKE: bit flipping key encapsulation (2022)"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Baldi, M., Barenghi, A., Chiaraluce, F., Pelosi, G., Santini, P.: LEDAcrypt: QC-LDPC Code-Based Cryptosystems with Bounded Decryption Failure Rate. In: International Workshop on Code-Based Cryptography (2019)","DOI":"10.1007\/978-3-030-25922-8_2"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Barenghi, A., Pelosi, G.: A comprehensive analysis of constant-time polynomial inversion for post-quantum cryptosystems. In: Proceedings of the 17th ACM International Conference on Computing Frontiers, pp. 269\u2013276, May 2020","DOI":"10.1145\/3387902.3397224"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., Yang, B.-Y.: Fast constant-time gcd computation and modular inversion. IACR transactions on cryptographic hardware and embedded systems, pp. 340\u2013398 (2019)","DOI":"10.46586\/tches.v2019.i3.340-398"},{"key":"12_CR5","volume-title":"Two algorithms for computing multiplicative inverses in $$GF(2^m)$$ using normal basis","author":"T Chang","year":"1998","unstructured":"Chang, T., Lu, E., Lee, Y., Leu, Y., Shyu, H.: Two algorithms for computing multiplicative inverses in $$GF(2^m)$$ using normal basis. Inf. Process, Lett (1998)"},{"issue":"1","key":"12_CR6","doi-asserted-by":"publisher","first-page":"277","DOI":"10.4310\/CMS.2011.v9.n1.a13","volume":"9","author":"G-L Chen","year":"2011","unstructured":"Chen, G.-L., Chen, Y.-Y., Li, J.-H., Li, Y.: An improvement of the TYT algorithm for $$GF (2^m)$$ based on reusing intermediate computation results. Commun. Math. Sci. 9(1), 277\u2013287 (2011)","journal-title":"Commun. Math. Sci."},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Drucker, N., Gueron, S., Kostic, D.: Fast polynomial inversion for post quantum QC-MDPC cryptography. Cyber Security Cryptography and Machine Learning: Fourth International Symposium, CSCML 2020, Be\u2019er Sheva, Israel, Cham: Springer International Publishing, pp. 340\u2013398, July 2-3, 2020","DOI":"10.1007\/978-3-030-49785-9_8"},{"issue":"12","key":"12_CR8","first-page":"3295","volume":"71","author":"A Galimberti","year":"2022","unstructured":"Galimberti, A., Montanaro, G., Zoni, D.: Efficient and Scalable FPGA Design of $$GF (2^m )$$ Inversion for Post-Quantum Cryptosystems. IEEE Trans. Comput. 71(12), 3295\u20133307 (2022)","journal-title":"IEEE Trans. Comput."},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Hoffstein, J., Lieman, D., Pipher, J., Silverman, J.H.: NTRU: a public key cryptosystem. NTRU Cryptosystems. Inc. www.ntru.com (1999)","DOI":"10.1007\/BFb0054868"},{"issue":"3","key":"12_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 inverses in GF($$2^m$$) using normal bases. Inf. Comput. 78(3), 171\u2013177 (1988)","journal-title":"Inf. Comput."},{"key":"12_CR11","unstructured":"Mahmoud, W.M.: Speeding Up Finite Field Inversion for Cryptographic Applications. University of Windsor (Canada) (2012)"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Richter-Brockmann, J., Chen, M.S., Ghosh, S., G\u00fcneysu, T.: Racing BIKE: improved polynomial multiplication and inversion in hardware. IACR Trans. Cryptographic Hardware Embedded Syst., 557\u2013588 (2021)","DOI":"10.46586\/tches.v2022.i1.557-588"},{"issue":"5","key":"12_CR13","doi-asserted-by":"publisher","first-page":"1204","DOI":"10.1109\/TC.2021.3078294","volume":"71","author":"J Richter-Brockmann","year":"2022","unstructured":"Richter-Brockmann, J., Mono, J., G\u00fcneysu, T.: Folding BIKE: scalable hardware implementation for reconfigurable devices. IEEE Trans. Comput. 71(5), 1204\u20131215 (2022)","journal-title":"IEEE Trans. Comput."},{"issue":"5","key":"12_CR14","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1109\/12.926155","volume":"50","author":"N Takagi","year":"2001","unstructured":"Takagi, N., Yoshiki, J.I., Takagi, K.: A fast algorithm for multiplicative inversion in $$GF (2^m)$$ using normal basis. IEEE Trans. Comput. 50(5), 394\u2013398 (2001)","journal-title":"IEEE Trans. Comput."},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"75809","DOI":"10.1109\/ACCESS.2020.2989423","volume":"8","author":"D Zoni","year":"2020","unstructured":"Zoni, D., Galimberti, A., Fornaciari, W.: Flexible and scalable FPGA-oriented design of multipliers for large binary polynomials. IEEE Access 8, 75809\u201375821 (2020)","journal-title":"IEEE Access"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 INDOCRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-80311-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T01:03:25Z","timestamp":1733965405000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-80311-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,12]]},"ISBN":["9783031803109","9783031803116"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-80311-6_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,12,12]]},"assertion":[{"value":"12 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"INDOCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology in India","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chennai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"indocrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}