{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T23:19:20Z","timestamp":1773962360439,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540003243","type":"print"},{"value":"9783540362883","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36288-6_18","type":"book-chapter","created":{"date-parts":[[2007,6,3]],"date-time":"2007-06-03T20:45:01Z","timestamp":1180903501000},"page":"240-254","source":"Crossref","is-referenced-by-count":21,"title":["On Montgomery-Like Representations for Elliptic Curves over GF(2k)"],"prefix":"10.1007","author":[{"given":"Martijn","family":"Stam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,12,18]]},"reference":[{"issue":"5","key":"18_CR1","first-page":"804","volume":"11","author":"G. Agnew","year":"1993","unstructured":"G. Agnew, R. Mullin, and S. Vanstone. An implementation ofellip tic curve cryptosystems over F2155. IEEE J-SAC, 11(5):804\u2013813, 1993. 241, 245","journal-title":"IEEE J-SAC"},{"key":"18_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/3-540-45537-X_20","volume-title":"SAC\u201901","author":"T. Akishita","year":"2001","unstructured":"T. Akishita. Fast simultaneous scalar multiplication on elliptic curve with Montgomery form. SAC\u201901, LNCS 2259, pages 255\u2013268. 241, 249"},{"issue":"3","key":"18_CR3","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/s001450010012","volume":"14","author":"D. Bailey","year":"2001","unstructured":"D. Bailey and C. Paar. Efficient arithmetic in finite field extensions with application in elliptic curve cryptography. Journal of Cryptology, 14(3):153\u2013176, 2001. 240","journal-title":"Journal of Cryptology"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"I. Blake, G. Seroussi, and N. Smart. Elliptic Curvesi n Cryptography. Cambridge University Press, 1999. 243","DOI":"10.1017\/CBO9781107360211"},{"key":"18_CR5","unstructured":"D. Bleichenbacher. Efficiency and Security of Cryptosystems based on Number Theory. PhD thesis, ETH Z\u00fcrich, 1996. 248"},{"key":"18_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/3-540-45664-3_24","volume-title":"PKC\u201902","author":"Brier","year":"2002","unstructured":"\u00c9. Brier and M. Joye. Weierstra\u03b2 elliptic curves and side-channel attacks. PKC\u201902, LNCS 2274, pages 335\u2013345. 241, 249"},{"key":"18_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/3-540-49649-1_6","volume-title":"Asiacrypt\u201998","author":"H. Cohen","year":"1998","unstructured":"H. Cohen, A. Miyaji, and T. Ono. Efficient elliptic curve exponentiation using mixed coordinates. Asiacrypt\u201998, LNCS 1514, pages 51\u201365. 240"},{"key":"18_CR8","series-title":"Lect Notes Comput Sci","volume-title":"CHES\u201900","author":"D. Hankerson","year":"1\u201324","unstructured":"D. Hankerson, J. L\u00f3pez Hernandez, and A. Menezes. Software implementation of elliptic curve cryptography over binary fields. CHES\u201900, LNCS 1965, pages 1\u201324. 242, 243, 244, 245"},{"key":"18_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1007\/3-540-45664-3_20","volume-title":"PKC\u201902","author":"T. Izu","year":"2002","unstructured":"T. Izu and T. Takagi. A fast parallel elliptic curve multiplication resistant against side channel attacks. PKC\u201902, LNCS 2274, pages 280\u2013296. 241, 245, 249"},{"key":"18_CR10","unstructured":"D. Johnson and A. Menezes. The elliptic curve digital signature algorithm (ECDSA). CACR Technical report CORR 99-31, University of W aterloo, 1999. 241"},{"key":"18_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/3-540-45537-X_11","volume-title":"SAC\u201901","author":"B. King","year":"2001","unstructured":"B. King. An improved implementation ofellip tic curves over GF(2n) when using projective point arithmetic. SAC\u201901, LNCS 2259, pages 134\u2013150. 240, 244"},{"key":"18_CR12","unstructured":"D. E. Knuth. Seminumerical Algorithms, volume 2 of The Art of Computer Programming. Addison Wesley, 3 edition, 1997. 248"},{"key":"18_CR13","volume-title":"Selected paperson analysis of algorithms","year":"2000","unstructured":"D. E. Knuth, editor. Selected paperson analysis of algorithms. CSLI Publications, Stanford, 2000. 253"},{"key":"18_CR14","first-page":"2","volume":"13","author":"D. E. Knuth","year":"1981","unstructured":"D. E. Knuth and C. H. Papadimitriou. Duality in addition chains. Bull. Eur. Assoc. Theor. Comput. Sci EATCS, 13:2\u20134, 1981. Reprinted in [13, Chapter 31]. 251","journal-title":"Bull. Eur. Assoc. Theor. Comput. Sci EATCS"},{"key":"18_CR15","first-page":"117","volume":"6","author":"D. H. Lehmer","year":"1969","unstructured":"D. H. Lehmer. Computer technology applied to the theory ofn umbers. Studiesin Number Theory, volume 6 of MAA Studiesin Mathematics, pages 117\u2013151, 1969. 249","journal-title":"Studiesin Number Theory"},{"key":"18_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/3-540-48892-8_16","volume-title":"SAC\u201998","author":"J. L\u00f3pez","year":"1999","unstructured":"J. L\u00f3pez and R. Dahab. Improved arithmetic for elliptic curve arithmetic in GF(2m). SAC\u201998, LNCS 1556, pages 201\u2013212. 244"},{"key":"18_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1007\/3-540-48059-5_27","volume-title":"CHES\u201999","author":"J. L\u00f3pez","year":"1999","unstructured":"J. L\u00f3pez and R. Dahab. Fast multiplication on elliptic curves over GF(2m) without precomputation. CHES\u201999, LNCS 1717, pages 316\u2013327. 241, 245, 246, 247, 248, 252"},{"issue":"4","key":"18_CR18","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF00203817","volume":"6","author":"A. J. Menezes","year":"1993","unstructured":"A. J. Menezes and S. A. Vanstone. Elliptic curve cryptosystems and their implementation. Journal of Cryptology, 6(4):209\u2013224, 1993.","journal-title":"Journal of Cryptology"},{"key":"18_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/3-540-45537-X_13","volume-title":"SAC\u201901","author":"B. M\u00f6ller","year":"2001","unstructured":"B. M\u00f6ller. Algorithms for multi-exponentiation. SAC\u201901, LNCS 2259, pages 165\u2013180. 244, 245"},{"key":"18_CR20","unstructured":"P. L. Montgomery. Evaluating recurrences off orm X m+n = f(Xm,Xn,Xm-n) via Lucas chains. Available from http:\/\/ftp.cwi.nl: \/pub\/pmontgom\/Lucas.ps.gz , 1983. 241, 248, 249, 250"},{"issue":"170","key":"18_CR21","doi-asserted-by":"publisher","first-page":"243","DOI":"10.2307\/2007888","volume":"48","author":"P. L. Montgomery","year":"1987","unstructured":"P. L. Montgomery. Speeding the Pollard and elliptic curve methods off actorization. Mathematicsof Computation, 48(170):243\u2013264, 1987. 240, 241, 242","journal-title":"Mathematicsof Computation"},{"key":"18_CR22","unstructured":"P. L. Montgomery, Aug. 2000. Private communication: expon2fitxt, Dual elliptic curve exponentiation. 249"},{"key":"18_CR23","unstructured":"National Institute of Sta ndards and Technology. Digital Signature Standard, 2000. FIPS Publication 186\u20132. 241"},{"key":"18_CR24","series-title":"Lect Notes Comput Sci","first-page":"238","volume-title":"PKC\u201900","author":"K. Okeya","year":"2004","unstructured":"K. Okeya, H. Kurumatani, and K. Sakurai. Elliptic curves with the Montgomeryform and their cryptographic applications. PKC\u201900, LNCS 1751, pages 238\u2013257. 241"},{"key":"18_CR25","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1007\/3-540-44709-1_12","volume-title":"CHES\u201901","author":"K. Okeya","year":"2001","unstructured":"K. Okeya and K. Sakurai. Efficient elliptic curve cryptosystems from a scalar multiplication algorithm with recovery oft he y-coordinate on a Montgomery-form elliptic curve. CHES\u201901, LNCS 2162, pages 126\u2013141. 241"},{"key":"18_CR26","doi-asserted-by":"crossref","unstructured":"B. Schoenmakers, Aug. 2000. Personal communication. 249","DOI":"10.1016\/S0029-6554(00)70030-3"},{"key":"18_CR27","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/3-540-45682-1_8","volume-title":"Asiacrypt\u201901","author":"M. Stam","year":"2001","unstructured":"M. Stam and A. K. Lenstra. Speeding up XTR. Asiacrypt\u201901, LNCS 2248, pages 125\u2013143. 241, 251"},{"key":"18_CR28","doi-asserted-by":"publisher","first-page":"806","DOI":"10.2307\/2312327","volume":"71","author":"E. G. Straus","year":"1964","unstructured":"E. G. Straus. Problems and solutions: (5125) addition chains ofv ectors. American Mathematical Monthly, 71:806\u2013808, 1964. 249","journal-title":"American Mathematical Monthly"},{"issue":"5","key":"18_CR29","first-page":"1227","volume":"E84-A","author":"Y. Tsuruoka","year":"2001","unstructured":"Y. Tsuruoka. Computing short Lucas chains for elliptic curve cryptosystems. IEICE Trans. Fundamentals, E84-A(5):1227\u20131233, 2001. 251","journal-title":"IEICE Trans. Fundamentals"},{"key":"18_CR30","unstructured":"S. A. Vanstone, R. C. Mullin, A. Antipa, and R. Gallant. Accelerated finite field operations on an elliptic curve. WO 99\/49386, Patent Cooperation Treaty, 1999. 241, 246, 252"}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography \u2014 PKC 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36288-6_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T04:42:26Z","timestamp":1683866546000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36288-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,12,18]]},"ISBN":["9783540003243","9783540362883"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/3-540-36288-6_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002,12,18]]}}}