{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,7]],"date-time":"2025-05-07T12:11:21Z","timestamp":1746619881704},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540892540"},{"type":"electronic","value":"9783540892557"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-89255-7_29","type":"book-chapter","created":{"date-parts":[[2008,12,1]],"date-time":"2008-12-01T07:27:00Z","timestamp":1228116420000},"page":"471-488","source":"Crossref","is-referenced-by-count":7,"title":["Speeding Up the Pollard Rho Method on Prime Fields"],"prefix":"10.1007","author":[{"given":"Jung Hee","family":"Cheon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jin","family":"Hong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minkyu","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"Adleman, L.: A Subexponential Algorithm for the Discrete Logarithm Problem with Applications to Cryptography. In: Proc. of the IEEE 20th Annual Symposium on Foundations of Computer Science (FOCS), pp. 55\u201360 (1979)","DOI":"10.1109\/SFCS.1979.2"},{"key":"29_CR2","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/BF01933190","volume":"20","author":"R. Brent","year":"1980","unstructured":"Brent, R.: An improved Monte Carlo Factorization Algorithm. BIT\u00a020, 176\u2013184 (1980)","journal-title":"BIT"},{"key":"29_CR3","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 Cryptology. IEEE Trans. Inform. Theory\u00a022, 644\u2013654 (1976)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"29_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-540-48000-6_10","volume-title":"Advances in Cryptology - ASIACRYPT\u201999","author":"I. Duursma","year":"1999","unstructured":"Duursma, I., Gaudry, P., Morain, F.: Speeding up the Discrete Log Computation on Curves with Automorphisms. In: Lam, K.-Y., Okamoto, E., Xing, C. (eds.) ASIACRYPT 1999. LNCS, vol.\u00a01716, pp. 103\u2013121. Springer, Heidelberg (1999)"},{"key":"29_CR5","unstructured":"Digital Signature Standard, NIST. U.S. Department of Commerce. Federal Information Processing Standards Publication (FIPS PUB) 186 (May 1994)"},{"key":"29_CR6","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T. ElGamal","year":"1985","unstructured":"ElGamal, T.: A Public Key Cryptosystem and a Signature Scheme based on Discrete Logarithms. IEEE Trans. Infrom. Theory\u00a031, 469\u2013472 (1985)","journal-title":"IEEE Trans. Infrom. Theory"},{"key":"29_CR7","doi-asserted-by":"publisher","first-page":"1699","DOI":"10.1090\/S0025-5718-99-01119-9","volume":"69","author":"R. Gallant","year":"2000","unstructured":"Gallant, R., Lambert, R., Vanstone, S.: Improving the Parallelized Pollard Lambda Search on Binary Anomalous Curves. Math. Comp.\u00a069, 1699\u20131705 (2000)","journal-title":"Math. Comp."},{"key":"29_CR8","first-page":"595","volume":"7","author":"A. Karatsuba","year":"1963","unstructured":"Karatsuba, A., Ofman, Y.: Multiplication of Multidigit Numbers on Automata. Soviet Physics-Doklady\u00a07, 595\u2013596 (1963)","journal-title":"Soviet Physics-Doklady"},{"key":"29_CR9","series-title":"Seminumerical Algorithms","volume-title":"The Art of Computer Programming","author":"D. Knuth","year":"1969","unstructured":"Knuth, D.: The Art of Computer Programming. Seminumerical Algorithms, vol.\u00a0II. Addison-Wesley, Reading (1969)"},{"key":"29_CR10","series-title":"Sorting and Searching","volume-title":"The Art of Computer Programming","author":"D. Knuth","year":"1973","unstructured":"Knuth, D.: The Art of Computer Programming. Sorting and Searching, vol.\u00a0III. Addison-Wesley, Reading (1973)"},{"key":"29_CR11","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.ipl.2004.01.016","volume":"90","author":"G. Nivasch","year":"2004","unstructured":"Nivasch, G.: Cycle Detection using a Stack. Information Processing Letters\u00a090, 135\u2013140 (2004)","journal-title":"Information Processing Letters"},{"key":"29_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/PL00003816","volume":"12","author":"P. Oorschot van","year":"1999","unstructured":"van Oorschot, P., Wiener, M.: Parallel Collision Search with Cryptanalytic Applications. J. Cryptology\u00a012, 1\u201328 (1999)","journal-title":"J. Cryptology"},{"key":"29_CR13","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/TIT.1978.1055817","volume":"24","author":"S. Pohlig","year":"1978","unstructured":"Pohlig, S., Hellman, M.: An Improved Algorithm for Computing Discrete Logarithms over GF(p) and its Cryptographic Significance. IEEE Trans. Inform. Theory\u00a024, 106\u2013110 (1978)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"143","key":"29_CR14","first-page":"918","volume":"32","author":"J. Pollard","year":"1978","unstructured":"Pollard, J.: A Monte Carlo Method for Index Computation (mod\n                  p). Math. Comp.\u00a032(143), 918\u2013924 (1978)","journal-title":"Math. Comp."},{"key":"29_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/3-540-46885-4_43","volume-title":"Advances in Cryptology - EUROCRYPT \u201989","author":"J. Quisquater","year":"1990","unstructured":"Quisquater, J., Delescaille, J.: How easy is Collision Search? Application to DES. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol.\u00a0434, pp. 429\u2013434. Springer, Heidelberg (1990)"},{"key":"29_CR16","first-page":"65","volume":"6","author":"J. Sattler","year":"1985","unstructured":"Sattler, J., Schnorr, C.: Generating Random Walks in Groups. Ann. -Univ. -Sci. -Budapest. -Sect. -Comput.\u00a06, 65\u201379 (1985)","journal-title":"Ann. -Univ. -Sci. -Budapest. -Sect. -Comput."},{"issue":"167","key":"29_CR17","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1090\/S0025-5718-1984-0744939-5","volume":"43","author":"C. Schnorr","year":"1984","unstructured":"Schnorr, C., Lenstra Jr., H.: A Monte Carlo Factoring Algorithm with Linear Storage. Math. Comp.\u00a043(167), 289\u2013311 (1984)","journal-title":"Math. Comp."},{"key":"29_CR18","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/BF02242355","volume":"7","author":"A. Sch\u00f6nhage","year":"1971","unstructured":"Sch\u00f6nhage, A., Strassen, V.: Schnelle Multiplikation Grobner Zahlen. Computing\u00a07, 281\u2013292 (1971)","journal-title":"Computing"},{"issue":"2","key":"29_CR19","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1137\/0211030","volume":"11","author":"R. Sedgewick","year":"1982","unstructured":"Sedgewick, R., Szymanski, T., Yao, A.: The Complexity of Finding Cycles in Periodic Functions. SIAM Journal on Computing\u00a011(2), 376\u2013390 (1982)","journal-title":"SIAM Journal on Computing"},{"key":"29_CR20","doi-asserted-by":"crossref","unstructured":"Shanks, D.: Class number, a Theory of Factorization and Genera. In: Proc. Symp. Pure Math., vol.\u00a020, pp. 415\u2013440 (1971)","DOI":"10.1090\/pspum\/020\/0316385"},{"key":"29_CR21","unstructured":"Shoup, V.: NTL: A Library for doing Number Theory, Ver 5.4.1, \n                    \n                      http:\/\/shoup.net\/ntl\/"},{"key":"29_CR22","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139165464","volume-title":"A Computational Introduction to Number Theory and Algebra","author":"V. Shoup","year":"2005","unstructured":"Shoup, V.: A Computational Introduction to Number Theory and Algebra. Cambridge University Press, Cambridge (2005)"},{"key":"29_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/BFb0054891","volume-title":"Algorithmic Number Theory","author":"E. Teske","year":"1998","unstructured":"Teske, E.: Speeding up Pollard\u2019s rho Method for Computing Discrete Logarithms. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol.\u00a01423, pp. 541\u2013554. Springer, Heidelberg (1998)"},{"key":"29_CR24","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1090\/S0025-5718-00-01213-8","volume":"70","author":"E. Teske","year":"2001","unstructured":"Teske, E.: On Random Walks for Pollard\u2019s rho Method. Math. Comp.\u00a070, 809\u2013825 (2001)","journal-title":"Math. Comp."},{"key":"29_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/3-540-48892-8_15","volume-title":"Selected Areas in Cryptography","author":"M. Wiener","year":"1999","unstructured":"Wiener, M., Zuccherato, R.: Fast Attacks on Elliptic Curve Cryptosystems. In: Tavares, S., Meijer, H. (eds.) SAC 1998. LNCS, vol.\u00a01556, pp. 190\u2013200. Springer, Heidelberg (1999)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - ASIACRYPT 2008"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89255-7_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T07:01:59Z","timestamp":1551682919000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89255-7_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540892540","9783540892557"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89255-7_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}