{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:07:36Z","timestamp":1743095256496,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319552262"},{"type":"electronic","value":"9783319552279"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-55227-9_14","type":"book-chapter","created":{"date-parts":[[2017,3,8]],"date-time":"2017-03-08T11:32:52Z","timestamp":1488972772000},"page":"193-207","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Efficient Finite Field Multiplication for Isogeny Based Post Quantum Cryptography"],"prefix":"10.1007","author":[{"given":"Angshuman","family":"Karmakar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sujoy Sinha","family":"Roy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frederik","family":"Vercauteren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ingrid","family":"Verbauwhede","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,3,9]]},"reference":[{"key":"14_CR1","unstructured":"De Feo, L., Jao, D., Pl\u00fbt, J.: Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies. https:\/\/eprint.iacr.org\/2011\/506.pdf"},{"issue":"5","key":"14_CR2","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"PW Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5), 1484\u20131509 (1997). arXiv:quant-ph\/9508027v2","journal-title":"SIAM J. Comput."},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Montgomery, P.: Modular multiplication without trial division 44, 519\u2013521 (1985) http:\/\/www.ams.org\/journals\/mcom\/1985-44-170\/S0025-5718-1985-0777282-X\/home.html","DOI":"10.1090\/S0025-5718-1985-0777282-X"},{"key":"14_CR4","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1007\/978-1-4419-5906-5_32","volume-title":"Encyclopedia of Cryptography and Security","author":"JA Solinas","year":"2011","unstructured":"Solinas, J.A.: Generalized Mersenne prime. In: van Tilborg, H.C.A., Jajodia, S. (eds.) Encyclopedia of Cryptography and Security, pp. 509\u2013510. Springer US, New York City (2011)"},{"key":"14_CR5","doi-asserted-by":"crossref","first-page":"774","DOI":"10.1007\/978-1-4419-5906-5_37","volume-title":"Encyclopedia of Cryptography and Security","author":"JA Solinas","year":"2011","unstructured":"Solinas, J.A.: Mersenne prime. In: van Tilborg, H.C.A. (ed.) Encyclopedia of Cryptography and Security, pp. 774\u2013775. Springer, US, New York City (2011)"},{"key":"14_CR6","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1007\/978-1-4419-5906-5_42","volume-title":"Encyclopedia of Cryptography and Security","author":"JA Solinas","year":"2011","unstructured":"Solinas, J.A.: Pseudo-Mersenne prime. In: van Tilborg, H.C.A., Jajodia, S. (eds.) Encyclopedia of Cryptography and Security, pp. 992\u2013992. Springer US, New York City (2011)"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/3-540-47721-7_24","volume-title":"Advances in Cryptology \u2014 CRYPTO 1986","author":"P Barrett","year":"1987","unstructured":"Barrett, P.: Implementing the rivest shamir and adleman public key encryption algorithm on a standard digital signal processor. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 311\u2013323. Springer, Heidelberg (1987). doi:10.1007\/3-540-47721-7_24"},{"key":"14_CR8","unstructured":"Childs, A., Jao, D., Soukharev, V.: Constructing elliptic curve isogenies in quantum subexponential time (2010). http:\/\/arxiv.org\/abs\/1012.4019\/"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-642-28365-9_5","volume-title":"Reconfigurable Computing: Architectures, Tools and Applications","author":"F Dinechin","year":"2012","unstructured":"Dinechin, F., Didier, L.-S.: Table-based division by small integer constants. In: Choy, O.C.S., Cheung, R.C.C., Athanas, P., Sano, K. (eds.) ARC 2012. LNCS, vol. 7199, pp. 53\u201363. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-28365-9_5"},{"key":"14_CR10","unstructured":"Donald, K.: The Art of Computer Programming, vol. 2. Addison-Wesley, Boston. Chapter 4"},{"issue":"2","key":"14_CR11","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s00200-013-0185-0","volume":"24","author":"S Galbraith","year":"2013","unstructured":"Galbraith, S., Stolbunov, A.: Improved algorithm for the isogeny problem for ordinary elliptic curves. Appl. Algebra Eng. Commun. Comput. 24(2), 107\u2013137 (2013)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"14_CR12","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-09494-6","volume-title":"The Arithmetic of Elliptic Curves","author":"JH Silverman","year":"2009","unstructured":"Silverman, J.H.: The Arithmetic of Elliptic Curves. Graduate Texts in Mathematics, vol. 106. Springer, New York (2009)"},{"issue":"2","key":"14_CR13","doi-asserted-by":"publisher","first-page":"215","DOI":"10.3934\/amc.2010.4.215","volume":"4","author":"A Stolbunov","year":"2010","unstructured":"Stolbunov, A.: Constructing public-key cryptographic schemes based on class group action on a set of isogenous elliptic curves. Adv. Math. Commun. 4(2), 215\u2013235 (2010)","journal-title":"Adv. Math. Commun."},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-319-11659-4_10","volume-title":"Post-Quantum Cryptography","author":"D Jao","year":"2014","unstructured":"Jao, D., Soukharev, V.: Isogeny-based quantum-resistant undeniable signatures. In: Mosca, M. (ed.) PQCrypto 2014. LNCS, vol. 8772, pp. 160\u2013179. Springer, Heidelberg (2014). doi:10.1007\/978-3-319-11659-4_10"},{"issue":"1","key":"14_CR15","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s00145-007-9002-x","volume":"22","author":"DX Charles","year":"2009","unstructured":"Charles, D.X., Lauter, K.E., Goren, E.Z.: Cryptographic hash functions from expander graphs. J. Cryptol. 22(1), 93\u2013113 (2009)","journal-title":"J. Cryptol."},{"key":"14_CR16","unstructured":"Tani, S.: Claw Finding Algorithms Using Quantum Walk, March 2008. http:\/\/arxiv.org\/abs\/0708.2584"},{"key":"14_CR17","unstructured":"Microsoft predicts practical quantum computers within 10 years. http:\/\/www.ibtimes.co.uk\/microsoft-predicts-practical-quantum-computers-within-10-years-1524268"},{"key":"14_CR18","first-page":"114","volume":"44","author":"RJ McEliece","year":"1978","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. DSN Prog. Rep. 44, 114\u2013116 (1978)","journal-title":"DSN Prog. Rep."},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/11496137_12","volume-title":"Applied Cryptography and Network Security","author":"J Ding","year":"2005","unstructured":"Ding, J., Schmidt, D.: Rainbow, a new multivariable polynomial signature scheme. In: Ioannidis, J., Keromytis, A., Yung, M. (eds.) ACNS 2005. LNCS, vol. 3531, pp. 164\u2013175. Springer, Heidelberg (2005). doi:10.1007\/11496137_12"},{"key":"14_CR20","unstructured":"Recommended elliptic curves for federal government use. http:\/\/csrc.nist.gov\/groups\/ST\/toolkit\/documents\/dss\/NISTReCur.pdf"},{"key":"14_CR21","unstructured":"The GNU multiple precision arithmetic library. https:\/\/gmplib.org\/"},{"key":"14_CR22","unstructured":"The PARI\/GP computer algebra system. http:\/\/pari.math.u-bordeaux.fr\/"}],"container-title":["Lecture Notes in Computer Science","Arithmetic of Finite Fields"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-55227-9_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T16:05:19Z","timestamp":1710345919000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-55227-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319552262","9783319552279"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-55227-9_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"9 March 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAIFI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on the Arithmetic of Finite Fields","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ghent","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Belgium","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 July 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 July 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waifi2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cage.ugent.be\/waifi\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}