{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:05:22Z","timestamp":1743005122680,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642019562"},{"type":"electronic","value":"9783642019579"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-01957-9_5","type":"book-chapter","created":{"date-parts":[[2009,5,15]],"date-time":"2009-05-15T11:24:25Z","timestamp":1242386665000},"page":"71-88","source":"Crossref","is-referenced-by-count":10,"title":["Novel Precomputation Schemes for Elliptic Curve Cryptosystems"],"prefix":"10.1007","author":[{"given":"Patrick","family":"Longa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Catherine","family":"Gebotys","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-540-76900-2_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2007","author":"D. Bernstein","year":"2007","unstructured":"Bernstein, D., Lange, T.: Faster Addition and Doubling on Elliptic Curves. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol.\u00a04833, pp. 29\u201350. Springer, Heidelberg (2007)"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-540-77224-8_4","volume-title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","author":"D. Bernstein","year":"2007","unstructured":"Bernstein, D., Lange, T.: Inverted Edwards Coordinates. In: Bozta\u015f, S., Lu, H.-F(F.) (eds.) AAECC 2007. LNCS, vol.\u00a04851, pp. 20\u201327. Springer, Heidelberg (2007)"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/3-540-45353-9_19","volume-title":"Topics in Cryptology - CT-RSA 2001","author":"M. Brown","year":"2001","unstructured":"Brown, M., Hankerson, D., Lopez, J., Menezes, A.: Software Implementation of the NIST Elliptic Curves over Prime Fields. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol.\u00a02020, pp. 250\u2013265. Springer, Heidelberg (2001)"},{"key":"5_CR4","unstructured":"FIPS PUB 186-2: Digital Signature Standard (DSS). National Institute of Standards and Technology (NIST) (2000)"},{"issue":"3","key":"5_CR5","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/S0020-0190(00)00134-4","volume":"76","author":"A. Higuchi","year":"2000","unstructured":"Higuchi, A., Takagi, N.: A Fast Addition Algorithm for Elliptic Curve Arithmetic in GF(2\n                    n\n                  ) using Projective Coordinates. Information Processing Letters\u00a076(3), 101\u2013103 (2000)","journal-title":"Information Processing Letters"},{"key":"5_CR6","unstructured":"Hisil, H., Wong, K., Carter, G., Dawson, E.: Faster Group Operations on Elliptic Curves. Cryptology ePrint Archive, Report 2007\/441 (2007)"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Hisil, H., Wong, K., Carter, G., Dawson, E.: An Intersection Form for Jacobi-Quartic Curves. Personal communication (2008)","DOI":"10.1007\/978-3-642-02620-1_31"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Koblitz, N.: Elliptic Curve Cryptosystems. Mathematics of Computation, vol. 48, pp. 203\u2013209 (1987)","DOI":"10.2307\/2007884"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/978-3-540-24852-1_34","volume-title":"Applied Cryptography and Network Security","author":"B. Kuang","year":"2004","unstructured":"Kuang, B., Zhu, Y., Zhang, Y.: An Improved Algorithm for uP+vQ using JSF3. In: Jakobsson, M., Yung, M., Zhou, J. (eds.) ACNS 2004. LNCS, vol.\u00a03089, pp. 467\u2013478. Springer, Heidelberg (2004)"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-540-46588-1_27","volume-title":"Public Key Cryptography","author":"C.H. Lim","year":"2000","unstructured":"Lim, C.H., Hwang, H.S.: Fast Implementation of Elliptic Curve Arithmetic in GF(p\n                  \n                    n\n                  ). In: Imai, H., Zheng, Y. (eds.) PKC 2000. LNCS, vol.\u00a01751, pp. 405\u2013421. Springer, Heidelberg (2000)"},{"key":"5_CR11","unstructured":"Longa, P.: ECC Point Arithmetic Formulae (EPAF), \n                    \n                      http:\/\/patricklonga.bravehost.com\/jacobian.html"},{"issue":"3","key":"5_CR12","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1109\/TC.2007.70815","volume":"57","author":"P. Longa","year":"2008","unstructured":"Longa, P., Miri, A.: Fast and Flexible Elliptic Curve Point Arithmetic over Prime Fields. IEEE Trans. Comp.\u00a057(3), 289\u2013302 (2008)","journal-title":"IEEE Trans. Comp."},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-540-78440-1_14","volume-title":"Public Key Cryptography \u2013 PKC 2008","author":"P. Longa","year":"2008","unstructured":"Longa, P., Miri, A.: New Composite Operations and Precomputation Scheme for Elliptic Curve Cryptosystems over Prime Fields. In: Cramer, R. (ed.) PKC 2008. LNCS, vol.\u00a04939, pp. 229\u2013247. Springer, Heidelberg (2008)"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"L\u00f3pez, J., Dahab, R.: Improved Algorithms for Elliptic Curve Arithmetic in GF(2n). Technical Report IC-98-39, Relatorio T\u00e9cnico (1998)","DOI":"10.1007\/3-540-48892-8_16"},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-540-73074-3_15","volume-title":"Arithmetic of Finite Fields","author":"N. Meloni","year":"2007","unstructured":"Meloni, N.: New Point Addition Formulae for ECC Applications. In: Carlet, C., Sunar, B. (eds.) WAIFI 2007. LNCS, vol.\u00a04547, pp. 189\u2013201. Springer, Heidelberg (2007)"},{"key":"5_CR16","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. Miller","year":"1986","unstructured":"Miller, V.: Use of Elliptic Curves in Cryptography. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol.\u00a0218, pp. 417\u2013426. Springer, Heidelberg (1986)"},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/3-540-45537-X_13","volume-title":"Selected Areas in Cryptography","author":"B. M\u00f6ller","year":"2001","unstructured":"M\u00f6ller, B.: Algorithms for Multi-exponentiation. In: Vaudenay, S., Youssef, A.M. (eds.) SAC 2001. LNCS, vol.\u00a02259, pp. 165\u2013180. Springer, Heidelberg (2001)"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/11506157_19","volume-title":"Information Security and Privacy","author":"K. Okeya","year":"2005","unstructured":"Okeya, K., Takagi, T., Vuillaume, C.: Efficient Representations on Koblitz Curves with Resistance to Side Channel Attacks. In: Boyd, C., Gonz\u00e1lez Nieto, J.M. (eds.) ACISP 2005. LNCS, vol.\u00a03574, pp. 218\u2013229. Springer, Heidelberg (2005)"},{"key":"5_CR19","unstructured":"Proos, J.: Joint Sparse Forms and Generating Zero Columns when Combing. Technical Report CORR 2003-23, University of Waterloo (2003)"},{"key":"5_CR20","unstructured":"Solinas, J.: Low-Weight Binary Representations for Pairs of Integers. Technical Report CORR 2001-41, University of Waterloo (2001)"}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-01957-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:14:33Z","timestamp":1558268073000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-01957-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642019562","9783642019579"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01957-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}