{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:54:22Z","timestamp":1740099262917,"version":"3.37.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030050719"},{"type":"electronic","value":"9783030050726"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-05072-6_3","type":"book-chapter","created":{"date-parts":[[2018,12,6]],"date-time":"2018-12-06T07:44:09Z","timestamp":1544082249000},"page":"37-51","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["NEON SIKE: Supersingular Isogeny Key Encapsulation on ARMv7"],"prefix":"10.1007","author":[{"given":"Amir","family":"Jalali","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reza","family":"Azarderakhsh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mehran Mozaffari","family":"Kermani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,12,7]]},"reference":[{"key":"3_CR1","unstructured":"Adj, G., Cervantes-V\u00e1zquez, D., Chi-Dom\u00ednguez, J., Menezes, A., Rodr\u00edguez-Henr\u00edquez, F.: On the cost of computing isogenies between supersingular elliptic curves. IACR Cryptology ePrint Archive 2018, 313 (2018). https:\/\/eprint.iacr.org\/2018\/313"},{"key":"3_CR2","unstructured":"ARM Limited: Cortex-A15 Technical Reference Manual (2010). http:\/\/infocenter.arm.com\/help\/topic\/com.arm.doc.ddi0438c\/DDI0438C_cortex_a15_r2p0_trm.pdf . Accessed June 2018"},{"key":"3_CR3","unstructured":"ARM Limited: Cortex-A8 Technical Reference Manual (2010). http:\/\/infocenter.arm.com\/help\/topic\/com.arm.doc.ddi0344k\/DDI0344K_cortex_a8_r3p2_trm.pdf . Accessed June 2018"},{"key":"3_CR4","unstructured":"Azarderakhsh, R., Fishbein, D., Jao, D.: Efficient implementations of a quantum-resistant key-exchange protocol on embedded systems. Technical report (2014). http:\/\/cacr.uwaterloo.ca\/techreports\/2014\/cacr2014-20.pdf"},{"key":"3_CR5","unstructured":"Bernstein, D.J., et al.: Classic McEliece: conservative code-based cryptography. NIST submissions (2017)"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/978-3-642-33027-8_19","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2012","author":"DJ Bernstein","year":"2012","unstructured":"Bernstein, D.J., Schwabe, P.: NEON crypto. In: Prouff, E., Schaumont, P. (eds.) CHES 2012. LNCS, vol. 7428, pp. 320\u2013339. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33027-8_19"},{"key":"3_CR7","unstructured":"Boneh, D., et al.: Multiparty non-interactive key exchange and more from isogenies on elliptic curves. arXiv preprint arXiv:1807.03038 (2018)"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Bos, J.W., Friedberger, S.: Fast arithmetic modulo $$2^{x}p^{y}\\pm 1$$2xpy\u00b11. In: 24th IEEE Symposium on Computer Arithmetic, ARITH 2017, London, United Kingdom, pp. 148\u2013155 (2017)","DOI":"10.1109\/ARITH.2017.15"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Bos, J.W., Friedberger, S.: Arithmetic considerations for isogeny based cryptography. IEEE Trans. Comput. (2018)","DOI":"10.1109\/TC.2018.2851238"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/978-3-662-43414-7_24","volume-title":"Selected Areas in Cryptography \u2013 SAC 2013","author":"JW Bos","year":"2014","unstructured":"Bos, J.W., Montgomery, P.L., Shumow, D., Zaverucha, G.M.: Montgomery multiplication using vector instructions. In: Lange, T., Lauter, K., Lison\u011bk, P. (eds.) SAC 2013. LNCS, vol. 8282, pp. 471\u2013489. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43414-7_24"},{"issue":"1","key":"3_CR11","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."},{"issue":"1","key":"3_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1515\/jmc-2012-0016","volume":"8","author":"AM Childs","year":"2014","unstructured":"Childs, A.M., Jao, D., Soukharev, V.: Constructing elliptic curve isogenies in quantum subexponential time. J. Math. Cryptol. 8(1), 1\u201329 (2014)","journal-title":"J. Math. Cryptol."},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/978-3-662-53018-4_21","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"C Costello","year":"2016","unstructured":"Costello, C., Longa, P., Naehrig, M.: Efficient algorithms for supersingular isogeny Diffie-Hellman. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9814, pp. 572\u2013601. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53018-4_21"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Faz-Hern\u00e1ndez, A., L\u00f3pez, J., Ochoa-Jim\u00e9nez, E., Rodr\u00edguez-Henr\u00edquez, F.: A faster software implementation of the supersingular isogeny diffie-hellman key exchange protocol. IEEE Trans. Comput. (2017)","DOI":"10.1109\/TC.2017.2771535"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-662-53887-6_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"SD Galbraith","year":"2016","unstructured":"Galbraith, S.D., Petit, C., Shani, B., Ti, Y.B.: On the security of supersingular isogeny cryptosystems. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10031, pp. 63\u201391. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53887-6_3"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-70694-8_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"SD Galbraith","year":"2017","unstructured":"Galbraith, S.D., Petit, C., Silva, J.: Identification protocols and signature schemes based on supersingular isogeny problems. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10624, pp. 3\u201333. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70694-8_1"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-319-72565-9_14","volume-title":"Selected Areas in Cryptography \u2013 SAC 2017","author":"A Jalali","year":"2018","unstructured":"Jalali, A., Azarderakhsh, R., Mozaffari-Kermani, M.: Efficient post-quantum undeniable signature on 64-Bit ARM. In: Adams, C., Camenisch, J. (eds.) SAC 2017. LNCS, vol. 10719, pp. 281\u2013298. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-72565-9_14"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Jalali, A., Azarderakhsh, R., Kermani, M.M., Jao, D.: Supersingular isogeny Diffie-Hellman key exchange on 64-bit arm. IEEE Trans. Dependable Secure Comput. (2017)","DOI":"10.1007\/978-3-030-05072-6_8"},{"key":"3_CR19","unstructured":"Jao, D., et al.: Supersingular isogeny key encapsulation. Submission to the NIST Post-Quantum Standardization project (2017). https:\/\/csrc.nist.gov\/Projects\/Post-Quantum-Cryptography\/Round-1-Submissions"},{"key":"3_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-642-25405-5_2","volume-title":"Post-Quantum Cryptography","author":"D Jao","year":"2011","unstructured":"Jao, D., De Feo, L.: Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies. In: Yang, B.-Y. (ed.) PQCrypto 2011. LNCS, vol. 7071, pp. 19\u201334. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25405-5_2"},{"key":"3_CR21","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, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11659-4_10"},{"key":"3_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-319-55227-9_14","volume-title":"Arithmetic of Finite Fields","author":"A Karmakar","year":"2016","unstructured":"Karmakar, A., Roy, S.S., Vercauteren, F., Verbauwhede, I.: Efficient finite field multiplication for isogeny based post quantum cryptography. In: Duquesne, S., Petkova-Nikova, S. (eds.) WAIFI 2016. LNCS, vol. 10064, pp. 193\u2013207. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-55227-9_14"},{"issue":"1","key":"3_CR23","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1109\/TCSI.2016.2611561","volume":"64\u2013I","author":"B Koziel","year":"2017","unstructured":"Koziel, B., Azarderakhsh, R., Kermani, M.M., Jao, D.: Post-quantum cryptography on FPGA based on isogenies on elliptic curves. IEEE Trans. Circuits Syst. 64\u2013I(1), 86\u201399 (2017)","journal-title":"IEEE Trans. Circuits Syst."},{"key":"3_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-319-48965-0_6","volume-title":"Cryptology and Network Security","author":"B Koziel","year":"2016","unstructured":"Koziel, B., Jalali, A., Azarderakhsh, R., Jao, D., Mozaffari-Kermani, M.: NEON-SIDH: efficient implementation of supersingular isogeny Diffie-Hellman key exchange protocol on ARM. In: Foresti, S., Persiano, G. (eds.) CANS 2016. LNCS, vol. 10052, pp. 88\u2013103. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-48965-0_6"},{"key":"3_CR25","unstructured":"Naehrig, M., et al.: FrodoKEM: practical quantum-secure key encapsulation from generic lattices. NIST submissions (2017)"},{"key":"3_CR26","unstructured":"Poppelmann, T., et al.: Newhope. NIST submissions (2017)"},{"key":"3_CR27","unstructured":"Rostovtsev, A., Stolbunov, A.: Public-key cryptosystem based on isogenies. IACR Cryptology ePrint Archive 2006, 145 (2006)"},{"key":"3_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/978-3-319-15943-0_20","volume-title":"Information Security and Cryptology - ICISC 2014","author":"H Seo","year":"2015","unstructured":"Seo, H., Liu, Z., Gro\u00dfsch\u00e4dl, J., Choi, J., Kim, H.: Montgomery modular multiplication on ARM-NEON revisited. In: Lee, J., Kim, J. (eds.) ICISC 2014. LNCS, vol. 8949, pp. 328\u2013342. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-15943-0_20"},{"key":"3_CR29","doi-asserted-by":"crossref","unstructured":"Seo, H., Liu, Z., Longa, P., Hu, Z.: SIDH on ARM: faster modular multiplications for faster post-quantum supersingular isogeny key exchange. IACR Cryptology ePrint Archive 2018, 700 (2018)","DOI":"10.46586\/tches.v2018.i3.1-20"},{"key":"3_CR30","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","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. GTM, vol. 106. Springer, New York (2009). https:\/\/doi.org\/10.1007\/978-0-387-09494-6"},{"issue":"50","key":"3_CR31","doi-asserted-by":"publisher","first-page":"5285","DOI":"10.1016\/j.tcs.2009.08.030","volume":"410","author":"S Tani","year":"2009","unstructured":"Tani, S.: Claw finding algorithms using quantum walk. Theor. Comput. Sci. 410(50), 5285\u20135297 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR32","first-page":"A238","volume":"273","author":"J V\u00e9lu","year":"1971","unstructured":"V\u00e9lu, J.: Isog\u00e9nies entre courbes elliptiques. CR Acad. Sci. Paris S\u00e9r. AB 273, A238\u2013A241 (1971)","journal-title":"CR Acad. Sci. Paris S\u00e9r. AB"},{"key":"3_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-319-70972-7_9","volume-title":"Financial Cryptography and Data Security","author":"Y Yoo","year":"2017","unstructured":"Yoo, Y., Azarderakhsh, R., Jalali, A., Jao, D., Soukharev, V.: A post-quantum digital signature scheme based on supersingular isogenies. In: Kiayias, A. (ed.) FC 2017. LNCS, vol. 10322, pp. 163\u2013181. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70972-7_9"}],"container-title":["Lecture Notes in Computer Science","Security, Privacy, and Applied Cryptography Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-05072-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,7]],"date-time":"2022-09-07T18:43:09Z","timestamp":1662576189000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-05072-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030050719","9783030050726"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-05072-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"SPACE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Security, Privacy, and Applied Cryptography Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kanpur","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"space2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/space2018.cse.iitk.ac.in\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"34","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"12","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"35% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}