{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:58:21Z","timestamp":1725487101794},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540734574"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73458-1_19","type":"book-chapter","created":{"date-parts":[[2007,7,4]],"date-time":"2007-07-04T15:09:27Z","timestamp":1183561767000},"page":"245-258","source":"Crossref","is-referenced-by-count":11,"title":["Affine Precomputation with Sole Inversion in Elliptic Curve Cryptography"],"prefix":"10.1007","author":[{"given":"Erik","family":"Dahmen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katsuyuki","family":"Okeya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Schepers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1007\/978-3-540-30564-4_9","volume-title":"Selected Areas in Cryptography","author":"R. Avanzi","year":"2004","unstructured":"Avanzi, R.: A Note on the Signed Sliding Window Integer Recoding and a Left-to-Right Analogue. In: Handschuh, H., Hasan, M.A. (eds.) SAC 2004. LNCS, vol.\u00a03357, pp. 130\u2013143. Springer, Heidelberg (2004)"},{"key":"19_CR2","series-title":"Lecture Note Series","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107360211","volume-title":"Elliptic Curves in Cryptography","author":"I. Blake","year":"1999","unstructured":"Blake, I., Seroussi, G., Smart, N.: Elliptic Curves in Cryptography (London Mathematical Society). Lecture Note Series, vol.\u00a0265. Cambridge University Press, Cambridge (1999)"},{"key":"19_CR3","doi-asserted-by":"crossref","DOI":"10.1201\/9781420034981","volume-title":"Handbook of elliptic and hyperelliptic curve cryptography","author":"H. Cohen","year":"2005","unstructured":"Cohen, H., Frey, G.: Handbook of elliptic and hyperelliptic curve cryptography. CRC Press, Boca Raton (2005)"},{"issue":"2","key":"19_CR4","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s10623-005-3299-y","volume":"39","author":"M. Ciet","year":"2006","unstructured":"Ciet, M., Joye, M., Lauter, K., Montgomery, P.: Trading Inversions for Multiplications in Elliptic Curve Cryptography. Designs, Codes and Cryptography\u00a039(2), 189\u2013206 (2006)","journal-title":"Designs, Codes and Cryptography"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/3-540-49649-1_6","volume-title":"Advances in Cryptology - ASIACRYPT\u201998","author":"H. Cohen","year":"1998","unstructured":"Cohen, H., Miyaji, A., Ono, T.: Efficient Elliptic Curve Exponentiation Using Mixed Coordinates. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol.\u00a01514, pp. 51\u201365. Springer, Heidelberg (1998)"},{"issue":"6","key":"19_CR6","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"IT-22","author":"W. Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.: New directions in cryptography. IEEE Transactions on Information Theory\u00a0IT-22(6), 644\u2013654 (1976)","journal-title":"IEEE Transactions on Information Theory"},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/3-540-36563-X_24","volume-title":"Topics in Cryptology - CT-RSA 2003","author":"K. Eisentr\u00e4ger","year":"2003","unstructured":"Eisentr\u00e4ger, K., Lauter, K., Montgomery, P.: Fast elliptic curve arithmetic and improved Weil pairing evaluation. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol.\u00a02612, pp. 343\u2013354. Springer, Heidelberg (2003)"},{"key":"19_CR8","volume-title":"Guide to Elliptic Curve Cryptography","author":"D. Hankerson","year":"2004","unstructured":"Hankerson, D., Menezes, A., Vanstone, S.: Guide to Elliptic Curve Cryptography. Springer, Heidelberg (2004)"},{"key":"19_CR9","unstructured":"Infineon Technologies, \n                    \n                      http:\/\/www.infineon.com\/"},{"key":"19_CR10","unstructured":"Johnson, D., Menezes, A.: The Elliptic Curve Digital Signature Algorithm (ECDSA) University of Waterloo, Technical Report CORR 99-34 (1999), available at \n                    \n                      http:\/\/www.cacr.math.uwaterloo.ca"},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/978-3-540-45238-6_20","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2003","author":"P. Joye","year":"2003","unstructured":"Joye, P., Paillier, P.: GCD-Free Algorithms for Computing Modular Inverses. In: D.Walter, C., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2003. LNCS, vol.\u00a02779, pp. 243\u2013253. Springer, Heidelberg (2003)"},{"issue":"177","key":"19_CR12","doi-asserted-by":"publisher","first-page":"203","DOI":"10.2307\/2007884","volume":"48","author":"N. Koblitz","year":"1987","unstructured":"Koblitz, N.: Elliptic Curve Cryptosystems. Mathematics of Computation\u00a048(177), 203\u2013209 (1987)","journal-title":"Mathematics of Computation"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/3-540-39799-X_31","volume-title":"Advances in Cryptology","author":"V.S. Miller","year":"1986","unstructured":"Miller, V.S.: Use of Elliptic Curves in Cryptography. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol.\u00a0218, pp. 417\u2013426. Springer, Heidelberg (1986)"},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/3-540-36552-4_21","volume-title":"Information Security and Cryptology - ICISC 2002","author":"B. M\u00f6ller","year":"2003","unstructured":"M\u00f6ller, B.: Improved Techniques for Fast Exponentiation. In: Lee, P.J., Lim, C.H. (eds.) ICISC 2002. LNCS, vol.\u00a02587, pp. 298\u2013312. Springer, Heidelberg (2003)"},{"key":"19_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/11496618_11","volume-title":"Information Security and Cryptology \u2013 ICISC 2004","author":"B. M\u00f6ller","year":"2005","unstructured":"M\u00f6ller, B.: Fractional Windows Revisited: Improved Signed-Digit Representations for Efficient Exponentiation. In: Park, C.-s., Chee, S. (eds.) ICISC 2004. LNCS, vol.\u00a03506, pp. 137\u2013153. Springer, Heidelberg (2005)"},{"key":"19_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1007\/978-3-540-30574-3_25","volume-title":"Topics in Cryptology \u2013 CT-RSA 2005","author":"J. Muir","year":"2005","unstructured":"Muir, J., Stinson, D.: New Minimal Weight Representations for Left-to-Right Window Methods. In: Menezes, A.J. (ed.) CT-RSA 2005. LNCS, vol.\u00a03376, pp. 366\u2013383. Springer, Heidelberg (2005)"},{"key":"19_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/978-3-540-28628-8_8","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"K. Okeya","year":"2004","unstructured":"Okeya, K., Schmidt-Samoa, K., Spahn, C., Takagi, T.: Signed Binary Representations Revisited. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 123\u2013139. Springer, Heidelberg (2004)"},{"key":"19_CR18","unstructured":"Renesas Technologies, \n                    \n                      http:\/\/www.renesas.com\/homepage.jsp\/"},{"key":"19_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/11545262_17","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2005","author":"M. Seysen","year":"2005","unstructured":"Seysen, M.: Using an RSA Accelerator for Modular Inversion. In: Rao, J.R., Sunar, B. (eds.) CHES 2005. LNCS, vol.\u00a03659, pp. 226\u2013236. Springer, Heidelberg (2005)"},{"key":"19_CR20","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1023\/A:1008306223194","volume":"19","author":"J.A. Solinas","year":"2000","unstructured":"Solinas, J.A.: Efficient Arithmetic on Koblitz Curves. Design, Codes and Cryptography\u00a019, 195\u2013249 (2000)","journal-title":"Design, Codes and Cryptography"},{"issue":"1","key":"19_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TC.2006.3","volume":"55","author":"K. Schmidt-Samoa","year":"2006","unstructured":"Schmidt-Samoa, K., Semay, O., Takagi, T.: Analysis of Some Fractional Window Recoding Methods and their Application to Elliptic Curve Cryptosystems. IEEE Transactions on Computers\u00a055(1), 1\u201310 (2006)","journal-title":"IEEE Transactions on Computers"}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73458-1_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:15:30Z","timestamp":1605762930000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73458-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540734574"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73458-1_19","relation":{},"subject":[]}}