{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T04:15:46Z","timestamp":1774671346858,"version":"3.50.1"},"reference-count":40,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2018,11,1]],"date-time":"2018-11-01T00:00:00Z","timestamp":1541030400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/100002418","name":"Intel Corporation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100002418","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["14\/50704-7"],"award-info":[{"award-number":["14\/50704-7"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Secure Execution of Cryptographic Algorithms"},{"name":"CNPq Brazil"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[2018,11,1]]},"DOI":"10.1109\/tc.2017.2771535","type":"journal-article","created":{"date-parts":[[2017,11,8]],"date-time":"2017-11-08T19:20:53Z","timestamp":1510168853000},"page":"1622-1636","source":"Crossref","is-referenced-by-count":62,"title":["A Faster Software Implementation of the Supersingular Isogeny Diffie-Hellman Key Exchange Protocol"],"prefix":"10.1109","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5502-8666","authenticated-orcid":false,"given":"Armando","family":"Faz-Hernandez","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5139-0158","authenticated-orcid":false,"given":"Julio","family":"Lopez","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7349-8546","authenticated-orcid":false,"given":"Eduardo","family":"Ochoa-Jimenez","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5916-6625","authenticated-orcid":false,"given":"Francisco","family":"Rodriguez-Henriquez","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","author":"granlund","year":"2016","journal-title":"GNU MP The GNU Multiple Precision Arithmetic Library"},{"key":"ref38","article-title":"Efficient\n implementation of a quantum-resistant key-exchange protocol on embedded systems","author":"azarderakhsh","year":"2014"},{"key":"ref33","first-page":"1","article-title":"Fast prime field elliptic-curve cryptography with 256-bit primes","author":"gueron","year":"2014","journal-title":"J Cryptographic Eng"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1049\/el:19991230"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.2307\/2007970"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70694-8"},{"key":"ref37","first-page":"148","article-title":"Fast arithmetic modulo $2^x p^y - 1$","author":"bos","year":"2017","journal-title":"Proc IEEE 24th Symp Comput Arithmetic"},{"key":"ref36","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1007\/978-3-642-13797-6_12","article-title":"Speeding up bipartite modular multiplication","author":"kne\u017eevi?","year":"2010","journal-title":"Proc 3rd Int Workshop Arithmetic Finite Fields"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-49649-1_1"},{"key":"ref34","article-title":"Modular reduction without pre-computation for special moduli","author":"acar","year":"2010"},{"key":"ref10","first-page":"572","article-title":"Efficient\n algorithms for supersingular isogeny Diffie-Hellman","author":"costello","year":"2016","journal-title":"Proc 36th Annu Int Cryptology Conf Advances Cryptology"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70972-7"},{"key":"ref11","first-page":"679","article-title":"Efficient compression of SIDH public keys","author":"costello","year":"2017","journal-title":"Proc 36th Annu Int Conf Theory Appl Cryptographic Techn Advances Cryptology"},{"key":"ref12","first-page":"191","article-title":"Fast hardware architectures for supersingular isogeny Diffie-Hellman key exchange on FPGA","author":"koziel","year":"2016","journal-title":"Proc of 7th Int Conf Cryptology Progress in Cryptology"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2016.2611561"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-72565-9"},{"key":"ref15","article-title":"Addition instructions with independent carry\n chains","author":"gopal","year":"2014"},{"key":"ref16","article-title":"The prime glossary","author":"caldwell","year":"2016"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1895-00317-1"},{"key":"ref18","author":"washington","year":"0","journal-title":"Elliptic Curves Number Theory and Cryptography 2nd Edition"},{"key":"ref19","first-page":"1","article-title":"Montgomery curves and their arithmetic","author":"costello","year":"2017","journal-title":"J Cryptographic Eng"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-13051-4_20"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-007-9002-x"},{"key":"ref27","first-page":"135","article-title":"Highly regular right-to-left algorithms for scalar multiplication","author":"joye","year":"2007","journal-title":"Proc Workshop Cryptographic Hardware Embedded Syst"},{"key":"ref3","article-title":"Cryptographic hash functions from expander graphs","author":"charles","year":"2006"},{"key":"ref6","article-title":"Constructing elliptic curve isogenies in quantum subexponential time","author":"childs","year":"2010"},{"key":"ref29","first-page":"84","article-title":"Three dimensional montgomery ladder, differential point tripling\n on Montgomery curves and point quintupling on Weierstrass&#x2019; and Edwards curves","author":"subramanya rao","year":"2016","journal-title":"Proc Cryptology 8th Int Conf Progress Cryptol"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2010.4.215"},{"key":"ref8","first-page":"19","article-title":"Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies","author":"jao","year":"2011","journal-title":"Proc 4th Int Workshop DRCN"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1515\/jmc-2012-0016","article-title":"Constructing elliptic curve isogenies in quantum subexponential time","volume":"8","author":"childs","year":"2014","journal-title":"J Math Cryptology"},{"key":"ref2","article-title":"Use of isogenies for design of cryptosystems","author":"jao","year":"2005"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1515\/jmc-2012-0015"},{"key":"ref1","article-title":"Hard homogeneous spaces","author":"couveignes","year":"2006"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1987-0866113-7"},{"key":"ref22","first-page":"126","article-title":"Efficient elliptic curve cryptosystems from a scalar multiplication algorithm with recovery of\n they-coordinate on a montgomery-form elliptic curve","author":"okeya","year":"2001","journal-title":"Proc 3rd Int Workshop Cryptographic Hardware Embedded Syst"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1017\/9781316271575.005"},{"key":"ref24","article-title":"Differential addition chains","author":"bernstein","year":"2006"},{"key":"ref23","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1007\/3-540-48059-5_27","article-title":"Fast multiplication on elliptic curves over GF(2m) without precomputation","author":"l\u00f3pez","year":"1999","journal-title":"Proc Workshop Cryptographic Hardware Embedded Syst"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/978-3-319-48965-0_6","article-title":"NEON-SIDH: Efficient implementation of supersingular\n isogeny diffie-hellman key exchange protocol on ARM","author":"koziel","year":"2016","journal-title":"Proc 15th Int Conf Cryptology Netw Secur"},{"key":"ref25","article-title":"Software for &#x201C;Quantum-resistant cryptosystems from\n supersingular elliptic curve isogenies","author":"de feo","year":"2011"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/12\/8485540\/08100879.pdf?arnumber=8100879","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T17:52:53Z","timestamp":1643219573000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8100879\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,1]]},"references-count":40,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tc.2017.2771535","relation":{},"ISSN":["0018-9340","1557-9956","2326-3814"],"issn-type":[{"value":"0018-9340","type":"print"},{"value":"1557-9956","type":"electronic"},{"value":"2326-3814","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,11,1]]}}}