{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T13:23:24Z","timestamp":1784121804509,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":92,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540338512","type":"print"},{"value":"9783540338529","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11745853_14","type":"book-chapter","created":{"date-parts":[[2006,4,13]],"date-time":"2006-04-13T09:18:58Z","timestamp":1144919938000},"page":"207-228","source":"Crossref","is-referenced-by-count":567,"title":["Curve25519: New Diffie-Hellman Speed Records"],"prefix":"10.1007","author":[{"given":"Daniel J.","family":"Bernstein","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"14_CR1","unstructured":"17th annual symposium on foundations of computer science. IEEE Computer Society, Long Beach (1976); MR 56:1766. See [52]."},{"key":"14_CR2","volume-title":"Public-key cryptography and computational number theory: proceedings of the international conference held in Warsaw","year":"2001","unstructured":"Alster, K., Urbanowicz, J., Williams, H.C. (eds.): Public-key cryptography and computational number theory: proceedings of the international conference held in Warsaw, September 11\u201315, 2000. Walter de Gruyter, Berlin (2001); ISBN 3\u201311\u2013017046\u20139. MR 2002h:94001. See [60]"},{"key":"#cr-split#-14_CR3.1","doi-asserted-by":"crossref","unstructured":"Antipa, A., Brown, D., Menezes, A., Struik, R., Vanstone, S.: Validation of elliptic curve public keys. In: [21], pp. 211???223 (2003);","DOI":"10.1007\/3-540-36288-6_16"},{"key":"#cr-split#-14_CR3.2","unstructured":"MR 2171928. Citations in this paper: ??1"},{"key":"#cr-split#-14_CR4.1","doi-asserted-by":"crossref","unstructured":"Avanzi, R.M.: Aspects of hyperelliptic curves over large prime fields in software implementations. In: [36], pp. 148???162 (2004);","DOI":"10.1007\/978-3-540-28632-5_11"},{"key":"#cr-split#-14_CR4.2","unstructured":"Citations in this paper: ??1, ??5"},{"key":"#cr-split#-14_CR5.1","doi-asserted-by":"crossref","unstructured":"Avanzi, R.M.: Generic algorithms for computing discrete logarithms. In: [19], pp. 477???494 (2005);","DOI":"10.1201\/9781420034981.pt5"},{"key":"#cr-split#-14_CR5.2","unstructured":"MR 2162735. Citations in this paper: ??3, ??3"},{"key":"#cr-split#-14_CR6.1","doi-asserted-by":"crossref","unstructured":"Avanzi, R.M., Mih??ilescu, P.: Generic efficient arithmetic algorithms for PAFFs (processor adequate finite fields) and related algebraic structures (extended abstract). In: [43], pp. 320???334 (2004);","DOI":"10.1007\/978-3-540-24654-1_23"},{"key":"#cr-split#-14_CR6.2","unstructured":"Citations in this paper: ??4"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s001450010012","volume":"14","author":"D.V. Bailey","year":"2001","unstructured":"Bailey, D.V., Paar, C.: Efficient arithmetic in finite field extensions with application in elliptic curve cryptography. Journal of Cryptology\u00a014, 153\u2013176 (2001); ISSN 0933\u20132790. Citations in this paper: \u00a71, \u00a74","journal-title":"Journal of Cryptology"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - CRYPTO 2000","year":"2000","unstructured":"Bellare, M. (ed.): CRYPTO 2000. LNCS, vol.\u00a01880. Springer, Heidelberg (2000); ISBN 3\u2013540\u201367907\u20133. MR 2002c:94002. See [14]"},{"key":"#cr-split#-14_CR9.1","doi-asserted-by":"crossref","unstructured":"Bender, A., Castagnoli, G.: On the implementation of elliptic curve cryptosystems. In: [16], pp. 186???192 (1990);","DOI":"10.1007\/0-387-34805-0_18"},{"key":"#cr-split#-14_CR9.2","unstructured":"MR 91d:11154. Citations in this paper: ??4"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Bentahar, K.: The equivalence between the DHP and DLP for elliptic curves used in practical applications (revisited, 2005); Citations in this paper: \u00a73, http:\/\/eprint.iacr.org\/2005\/307","DOI":"10.1007\/11586821_25"},{"key":"#cr-split#-14_CR11.1","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J.: The Poly1305-AES message-authentication code. In: [32], pp. 32???49 (2005);","DOI":"10.1007\/11502760_3"},{"key":"#cr-split#-14_CR11.2","unstructured":"ID 0018d9551b5 546d97c340e0dd8cb5750. Citations in this paper: ??4, http:\/\/cr.yp.to\/papers.html#poly1305"},{"key":"#cr-split#-14_CR12.1","unstructured":"Bernstein, D.J.: Cache-timing attacks on AES (2005);"},{"key":"#cr-split#-14_CR12.2","unstructured":"ID cd9faae9bd5308c440df50fc26a517b4. Citations in this paper: ??1, ??4, http:\/\/cr.yp.to\/papers.html#cachetiming"},{"key":"#cr-split#-14_CR13.1","unstructured":"Bernstein, D.J.: Salsa20 specification (2005);"},{"key":"#cr-split#-14_CR13.2","unstructured":"Citations in this paper: ??3, http:\/\/cr.yp.to\/snuffle.html"},{"key":"#cr-split#-14_CR14.1","doi-asserted-by":"crossref","unstructured":"Biehl, I., Meyer, B., M??ller, V.: Differential fault attacks on elliptic curve cryptosystems (extended abstract). In: [8], pp. 131???146 (2000);","DOI":"10.1007\/3-540-44598-6_8"},{"key":"#cr-split#-14_CR14.2","unstructured":"Citations in this paper: ??1, ??3, http:\/\/lecturer.ukdw.ac.id\/vmueller\/publications.php"},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - ASIACRYPT 2001","year":"2001","unstructured":"Boyd, C. (ed.): ASIACRYPT 2001. LNCS, vol.\u00a02248. Springer, Heidelberg (2001); ISBN 3\u2013540\u201342987\u20135. MR 2003d:94001. See [59]"},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - CRYPTO 1989","year":"1990","unstructured":"Brassard, G. (ed.): CRYPTO 1989. LNCS, vol.\u00a0435. Springer, Heidelberg (1990); ISBN 0\u2013387\u201397317\u20136. MR 91b:94002. See [9]"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Brown, M., Hankerson, D., L\u00f3pez, J., Menezes, A.: Software implementation of the NIST elliptic curves over prime fields (2000); see also newer version [18]. Citations in this paper: \u00a71, \u00a75, http:\/\/www.cacr.math.uwaterloo.ca\/techreports\/2000\/corr2000-56.ps","DOI":"10.1007\/3-540-44499-8_1"},{"key":"14_CR18","unstructured":"Brown, M., Hankerson, D., L\u00f3pez, J., Menezes, A.: Software implementation of the NIST elliptic curves over prime fields. In: [49], pp. 250\u2013265 (2001); see also older version [17]. MR 1907102"},{"key":"14_CR19","volume-title":"Handbook of elliptic and hyperelliptic curve cryptography","year":"2005","unstructured":"Cohen, H., Frey, G. (eds.): Handbook of elliptic and hyperelliptic curve cryptography. CRC Press, Boca Raton (2005); ISBN 1\u201358488\u2013518\u20131. See [5], [24], [25], [30]"},{"key":"14_CR20","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - CRYPTO 1994","year":"1994","unstructured":"Desmedt, Y. (ed.): CRYPTO 1994. LNCS, vol.\u00a0839. Springer, Heidelberg (1994); See [44]"},{"key":"14_CR21","series-title":"Lecture Notes in Computer Science","volume-title":"Public Key Cryptography - PKC 2003","year":"2002","unstructured":"Desmedt, Y. (ed.): PKC 2003. LNCS, vol.\u00a02567. Springer, Heidelberg (2002); ISBN 3\u2013540\u201300324\u2013X. See [3]"},{"key":"14_CR22","first-page":"1","volume":"18","author":"C. Diem","year":"2003","unstructured":"Diem, C.: The GHS attack in odd characteristic. Journal of the Ramanujan Mathematical Society\u00a018, 1\u201332 (2003); MR 2004a:14030. Citations in this paper: \u00a74, http:\/\/www.math.uni-leipzig.de\/~diem\/preprints","journal-title":"Journal of the Ramanujan Mathematical Society"},{"key":"14_CR23","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W. Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.: New directions in cryptography. IEEE Transactions on Information Theory\u00a022, 644\u2013654 (1976); ISSN 0018\u20139448. MR 55:10141. Citations in this paper: \u00a73, http:\/\/cr.yp.to\/bib\/entries.html#1976\/diffie","journal-title":"IEEE Transactions on Information Theory"},{"key":"#cr-split#-14_CR24.1","doi-asserted-by":"crossref","unstructured":"Doche, C., Lange, T.: Arithmetic of elliptic curves. In: [19], pp. 267???302 (2005);","DOI":"10.1201\/9781420034981.pt3"},{"key":"#cr-split#-14_CR24.2","unstructured":"MR 2162729. Citations in this paper: ??A"},{"key":"#cr-split#-14_CR25.1","doi-asserted-by":"crossref","unstructured":"Doche, C., Lange, T.: Arithmetic of special curves. In: [19], pp. 355???387 (2005);","DOI":"10.1201\/9781420034981.ch15"},{"key":"#cr-split#-14_CR25.2","unstructured":"MR 2162731. Citations in this paper: ??4"},{"key":"14_CR26","doi-asserted-by":"crossref","unstructured":"Fong, K., Hankerson, D., L\u00f3pez, J., Menezes, A.: Field inversion and point halving revisited (2003); see also newer version [27]. Citations in this paper: \u00a71, http:\/\/www.cacr.math.uwaterloo.ca\/techreports\/2003\/techreports2003.html","DOI":"10.1109\/TC.2004.43"},{"key":"14_CR27","doi-asserted-by":"publisher","first-page":"1047","DOI":"10.1109\/TC.2004.43","volume":"53","author":"K. Fong","year":"2004","unstructured":"Fong, K., Hankerson, D., L\u00f3pez, J., Menezes, A.: Field inversion and point halving revisited. IEEE Transactions on Computers\u00a053, 1047\u20131059 (2004); see also older version [26]. ISSN 0018\u20139340","journal-title":"IEEE Transactions on Computers"},{"key":"#cr-split#-14_CR28.1","unstructured":"Franke, J., Kleinjung, T., Paar, C., Pelzl, J., Priplata, C., Simka, M., Stahlke, C.: In: Workshop Record of SHARCS 2005, pp. 51???62 (2005);"},{"key":"#cr-split#-14_CR28.2","unstructured":"Citations in this paper: ??3, ??3, http:\/\/www.best.tuke.sk\/simka\/pub.html"},{"key":"#cr-split#-14_CR29.1","unstructured":"Frey, G.: How to disguise an elliptic curve, Weil descent (1998);"},{"key":"#cr-split#-14_CR29.2","unstructured":"Citations in this paper: ??4, http:\/\/www.cacr.math.uwaterloo.ca\/conferences\/1998\/ecc98\/slides.html"},{"key":"#cr-split#-14_CR30.1","doi-asserted-by":"crossref","unstructured":"Frey, G., Lange, T.: Transfer of discrete logarithms. In: [19], pp. 529???543 (2005);","DOI":"10.1201\/9781420034981.ch22"},{"key":"#cr-split#-14_CR30.2","unstructured":"MR 2162738. Citations in this paper: ??3"},{"key":"#cr-split#-14_CR31.1","doi-asserted-by":"crossref","unstructured":"Robert, P., Gallant, R.J., Lambert, S.A.: Faster point multiplication on elliptic curves with efficient endomorphisms. In: [38], pp. 190???200 (2001);","DOI":"10.1007\/3-540-44647-8_11"},{"key":"#cr-split#-14_CR31.2","unstructured":"MR 2003h:14043. Citations in this paper: ??5."},{"key":"14_CR32","series-title":"Lecture Notes in Computer Science","volume-title":"Fast software encryption","year":"2005","unstructured":"Gilbert, H., Handschuh, H. (eds.): FSE 2005. LNCS, vol.\u00a03557. Springer, Heidelberg (2005); ISBN 3\u2013540\u2013 26541\u20134. See [11]."},{"key":"#cr-split#-14_CR33.1","doi-asserted-by":"crossref","unstructured":"Hankerson, D., Hernandez, J.L., Menezes, A.: Software implementation of elliptic curve cryptography over binary fields (2000);","DOI":"10.1007\/3-540-44499-8_1"},{"key":"#cr-split#-14_CR33.2","unstructured":"Citations in this paper: ??1, see also newer version [34], http:\/\/www.cacr.math.uwaterloo.ca\/techreports\/2000\/corr2000-42.ps"},{"key":"14_CR34","doi-asserted-by":"crossref","unstructured":"Hankerson, D., Hernandez, J.L., Menezes, A.: Software implementation of elliptic curve cryptography over binary fields. In: [40], pp. 1\u201324 (2000); see also older version [33]","DOI":"10.1007\/3-540-44499-8_1"},{"key":"14_CR35","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, New York (2004); ISBN 0\u2013387\u201395273\u2013X. MR 2054891. Citations in this paper: \u00a74"},{"key":"14_CR36","series-title":"Lecture Notes in Computer Science","volume-title":"Cryptographic hardware and embedded systems\u2014CHES 2004","year":"2004","unstructured":"Joye, M., Quisquater, J.-J. (eds.): CHES 2004. LNCS, vol.\u00a03156. Springer, Heidelberg (2004); ISBN 3\u2013540\u201322666\u20134. See [4]"},{"key":"14_CR37","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - CRYPTO 1997","year":"1997","unstructured":"Kaliski Jr., B.S. (ed.): CRYPTO 1997. LNCS, vol.\u00a01294. Springer, Heidelberg (1997); ISBN 3\u2013540\u201363384\u20137. MR 99a:94041. See [42]"},{"key":"14_CR38","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - CRYPTO 2001","year":"2001","unstructured":"Kilian, J. (ed.): CRYPTO 2001. LNCS, vol.\u00a02139. Springer, Heidelberg (2001); ISBN 3\u2013540\u201342456\u20133. MR 2003d:94002. See [31]"},{"key":"#cr-split#-14_CR39.1","doi-asserted-by":"crossref","unstructured":"Koblitz, N., Menezes, A.J.: Another look at provable security (2004);","DOI":"10.1007\/s00145-005-0432-z"},{"key":"#cr-split#-14_CR39.2","unstructured":"Citations in this paper: ??3, http:\/\/www.cacr.math.uwaterloo.ca\/~ajmeneze\/publications\/provable.pdf"},{"key":"14_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44499-8","volume-title":"Cryptographic hardware and embedded systems\u2014 CHES 2000","author":"\u00c7.K. Ko\u0327c","year":"2000","unstructured":"Ko\u0327c, \u00c7.K., Paar, C.: CHES 2000. LNCS, vol.\u00a01965. Springer, Heidelberg (2000); ISBN 3\u2013540\u201342521\u20137. See [34]"},{"key":"#cr-split#-14_CR41.1","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Struik, R.: Random walks revisited: extensions of Pollard???s rho algorithm for computing multiple discrete logarithms. In: [64], pp. 212???229 (2001);","DOI":"10.1007\/3-540-45537-X_17"},{"key":"#cr-split#-14_CR41.2","unstructured":"Citations in this paper: ??3, http:\/\/www.distcomp.ethz.ch\/publications.html"},{"key":"#cr-split#-14_CR42.1","doi-asserted-by":"crossref","unstructured":"Lim, C.H., Lee, P.J.: A key recovery attack on discrete log-based schemes using a prime order subgroup. In: [37], pp. 249???263 (1997);","DOI":"10.1007\/BFb0052240"},{"key":"#cr-split#-14_CR42.2","unstructured":"Citations in this paper: ??3, ??3, http:\/\/dasan.sejong.ac.kr\/~chlim\/english_pub.html"},{"key":"14_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/b96837","volume-title":"Selected areas in cryptography","author":"M. Matsui","year":"2004","unstructured":"Matsui, M., Zuccherato, R.: SAC 2003. LNCS, vol.\u00a03006. Springer, Heidelberg (2004); ISBN 3\u2013540\u201321370\u20138. See [6]"},{"key":"#cr-split#-14_CR44.1","doi-asserted-by":"crossref","unstructured":"Maurer, U.M.: Towards the equivalence of breaking the Diffie-Hellman protocol and computing discrete logarithms. In: [20], pp. 271???281 (1994);","DOI":"10.1007\/3-540-48658-5_26"},{"key":"#cr-split#-14_CR44.2","unstructured":"Citations in this paper: ??3, http:\/\/www.crypto.ethz.ch\/~maurer\/publications.html"},{"key":"#cr-split#-14_CR45.1","unstructured":"Menezes, A.: Another look at HMQV (2005);"},{"key":"#cr-split#-14_CR45.2","unstructured":"Citations in this paper: ??2, http:\/\/eprint.iacr.org\/2005\/205"},{"key":"#cr-split#-14_CR46.1","doi-asserted-by":"crossref","unstructured":"Miller, V.S.: Use of elliptic curves in cryptography. In: [65], pp. 417???426 (1986);","DOI":"10.1007\/3-540-39799-X_31"},{"key":"#cr-split#-14_CR46.2","unstructured":"MR 88b:68040. Citations in this paper: ??1"},{"key":"14_CR47","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1090\/S0025-5718-1987-0866113-7","volume":"48","author":"P.L. Montgomery","year":"1987","unstructured":"Montgomery, P.L.: Speeding the Pollard and elliptic curve methods of factorization. Mathematics of Computation\u00a048, 243\u2013264 (1987); ISSN 0025\u20135718. Citations in this paper: \u00a75, http:\/\/cr.yp.to\/bib\/entries.html#1987\/montgomery","journal-title":"Mathematics of Computation"},{"key":"14_CR48","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1112\/S1461157000001042","volume":"7","author":"A. Muzereau","year":"2004","unstructured":"Muzereau, A., Smart, N.P., Vercauteren, F.: The equivalence between the DHP and DLP for elliptic curves used in practical applications. LMS Journal of Computation and Mathematics\u00a07, 50\u201372 (2004); Citations in this paper: \u00a73, http:\/\/www.lms.ac.uk\/jcm\/7\/lms2003-034\/","journal-title":"LMS Journal of Computation and Mathematics"},{"key":"14_CR49","series-title":"Lecture Notes in Computer Science","volume-title":"Topics in Cryptology - CT-RSA 2001","year":"2001","unstructured":"Naccache, D. (ed.): CT-RSA 2001. LNCS, vol.\u00a02020. Springer, Heidelberg (2001); ISBN 3\u2013 540\u201341898\u20139. MR 2003a:94039. See [18]"},{"key":"#cr-split#-14_CR50.1","doi-asserted-by":"crossref","unstructured":"Osvik, D.A., Shamir, A., Tromer, E.: Cache atacks and countermeasures: the case of AES, extended version (2005);","DOI":"10.1007\/11605805_1"},{"key":"#cr-split#-14_CR50.2","unstructured":"Citations in this paper: ??1, http:\/\/www.wisdom.weizmann.ac.il\/~tromer\/"},{"key":"#cr-split#-14_CR51.1","unstructured":"Percival, C.: Cache missing for fun and profit (2005);"},{"key":"#cr-split#-14_CR51.2","unstructured":"Citations in this paper: ??1, http:\/\/www.daemonology.net\/hyperthreading-considered-harmful\/"},{"key":"14_CR52","doi-asserted-by":"crossref","unstructured":"Pippenger, N.: On the evaluation of powers and related problems (preliminary version). In: [1], pp. 258\u2013263 (1976); newer version split into [53] and [54]. MR 58:3682. Citations in this paper: \u00a75, http:\/\/cr.yp.to\/bib\/entries.html#1976\/pippenger","DOI":"10.1109\/SFCS.1976.21"},{"key":"14_CR53","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF01776581","volume":"12","author":"N. Pippenger","year":"1979","unstructured":"Pippenger, N.: The minimum number of edges in graphs with prescribed paths. Mathematical Systems Theory\u00a012, 325\u2013346 (1979); see also older version [52], ISSN 0025\u20135661. MR 81 e:05079, http:\/\/cr.yp.to\/bib\/entries.html#1979\/pippenger","journal-title":"Mathematical Systems Theory"},{"key":"14_CR54","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1137\/0209022","volume":"9","author":"N. Pippenger","year":"1980","unstructured":"Pippenger, N.: On the evaluation of powers and monomials. SIAM Journal on Computing\u00a09, 230\u2013250 (1980); see also older version [52]. ISSN 0097\u20135397. MR 82c:10064, http:\/\/cr.yp.to\/bib\/entries.html#1980\/pippenger","journal-title":"SIAM Journal on Computing"},{"key":"14_CR55","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/s001450010010","volume":"13","author":"J.M. Pollard","year":"2000","unstructured":"Pollard, J.M.: Kangaroos, Monopoly and discrete logarithms. Journal of Cryptology\u00a013, 437\u2013447 (2000); ISSN 0933\u20132790. Citations in this paper: \u00a73","journal-title":"Journal of Cryptology"},{"key":"#cr-split#-14_CR56.1","doi-asserted-by":"crossref","unstructured":"Proos, J., Zalka, C.: Shor???s discrete logarithm quantum algorithm for elliptic curves (2003);","DOI":"10.26421\/QIC3.4-3"},{"key":"#cr-split#-14_CR56.2","unstructured":"Citations in this paper: ??1, http:\/\/www.cacr.math.uwaterloo.ca\/techreports\/2003\/tech_reports2003.html"},{"key":"14_CR57","unstructured":"Smart, N.P.: A comparison of different finite fields for use in elliptic curve cryptosystems (2000); see also newer version [58], http:\/\/www.cs.bris.ac.uk\/Publications\/pub_info.jsp?id=1000458"},{"key":"14_CR58","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/S0898-1221(01)00133-X","volume":"42","author":"N.P. Smart","year":"2001","unstructured":"Smart, N.P.: A comparison of different finite fields for elliptic curve cryptosystems. Computers and Mathematics with Applications\u00a042, 91\u2013100 (2001); see also older version [57]. MR 2002c:94033. Citations in this paper: \u00a71","journal-title":"Computers and Mathematics with Applications"},{"key":"#cr-split#-14_CR59.1","doi-asserted-by":"crossref","unstructured":"Stam, M., Lenstra, A.K.: Speeding up XTR. In: [15], pp. 125???143 (2001);","DOI":"10.1007\/3-540-45682-1_8"},{"key":"#cr-split#-14_CR59.2","unstructured":"MR 2003h:94049. Citations in this paper: ??5"},{"key":"#cr-split#-14_CR60.1","unstructured":"Teske, E.: Square-root algorithms for the discrete logarithm problem (a survey). In: [2], pp. 283???301 (2001);"},{"key":"#cr-split#-14_CR60.2","unstructured":"MR 2003c:11156. Citations in this paper: ??3, http:\/\/www.cacr.math.uwaterloo.ca\/~eteske\/publications.html"},{"key":"14_CR61","unstructured":"Teske, E.: Computing discrete logarithms with the parallelized kangaroo method (2001); see also newer version [62]. Citations in this paper: \u00a73, http:\/\/www.cacr.math.uwaterloo.ca\/techreports\/2001\/tech_reports2001.html"},{"key":"14_CR62","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/S0166-218X(02)00590-5","volume":"130","author":"E. Teske","year":"2003","unstructured":"Teske, E.: Computing discrete logarithms with the parallelized kangaroo method. Discrete Applied Mathematics\u00a0130, 61\u201382 (2003); see also older version [61]. MR 2004h:11112","journal-title":"Discrete Applied Mathematics"},{"key":"14_CR63","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/PL00003816","volume":"12","author":"P.C. Oorschot van","year":"1999","unstructured":"van Oorschot, P.C., Wiener, M.: Parallel collision search with cryptanalytic applications. Journal of Cryptology\u00a012, 1\u201328 (1999); ISSN 0933\u20132790. Citations in this paper: \u00a73, http:\/\/members.rogers.com\/paulv\/papers\/pubs.html","journal-title":"Journal of Cryptology"},{"key":"14_CR64","series-title":"Lecture Notes in Computer Science","volume-title":"Selected Areas in Cryptography","year":"2001","unstructured":"Vaudenay, S., Youssef, A.M. (eds.): SAC 2001. LNCS, vol.\u00a02259. Springer, Heidelberg (2001); ISBN 3\u2013540\u201343066\u20130. MR 2004k:94066. See [41]"},{"key":"14_CR65","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology","year":"1986","unstructured":"Williams, H.C. (ed.): CRYPTO 1985. LNCS, vol.\u00a0218. Springer, Heidelberg (1986); ISBN 3\u2013540\u201316463\u20134. See [46]"}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography - PKC 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11745853_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,25]],"date-time":"2021-07-25T16:25:26Z","timestamp":1627230326000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11745853_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540338512","9783540338529"],"references-count":92,"URL":"https:\/\/doi.org\/10.1007\/11745853_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}