{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,19]],"date-time":"2023-01-19T23:28:04Z","timestamp":1674170884469},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540430667","type":"print"},{"value":"9783540455370","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45537-x_17","type":"book-chapter","created":{"date-parts":[[2007,6,3]],"date-time":"2007-06-03T21:29:27Z","timestamp":1180906167000},"page":"212-229","source":"Crossref","is-referenced-by-count":19,"title":["Random Walks Revisited: Extensions of Pollard\u2019s Rho Algorithm for Computing Multiple Discrete Logarithms"],"prefix":"10.1007","author":[{"given":"Fabian","family":"Kuhn","sequence":"first","affiliation":[]},{"given":"Ren\u00e9","family":"Struik","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,12,20]]},"reference":[{"key":"17_CR1","series-title":"Lect Notes Comput Sci","first-page":"147","volume-title":"Advances of Cryptology\u2014CRYPTO\u201993","author":"L. Adleman","year":"1993","unstructured":"L. Adleman and J. De Marrais, A Subexponential Algorithm for Discrete Logarithms over All Finite Fields, in Advances of Cryptology\u2014CRYPTO\u201993, D.R. Stinson, Ed., pp. 147\u2013158, Lecture Notes in Computer Science, Vol. 773, Berlin: Springer, 1993."},{"key":"17_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1007\/3-540-58691-1_39","volume-title":"Algorithmic Number Theory","author":"L. Adleman","year":"1994","unstructured":"L. Adleman, J. DeMarrais and M. Huang, A Subexponential Algorithm for Discrete Logarithms over the RationalSubgroup of the Jacobians of Large genus Hyperelliptic Curves over Finite Fields, in Algorithmic Number Theory, pp. 28\u201340, Lecture Notes in Computer Science, Vol. 877, Berlin: Springer, 1994."},{"issue":"2","key":"17_CR3","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/BF01933190","volume":"20","author":"R.P. Brent","year":"1980","unstructured":"R.P. Brent, An Improved Monte Carlo Factorization Algorithm, j-BIT, Vol. 20, No. 2, pp. 176\u2013184, 1980.","journal-title":"j-BIT"},{"key":"17_CR4","volume-title":"A Course in Combinatorics","author":"J.H. Lint van","year":"1992","unstructured":"J.H. van Lint and R.M. Wilson, A Course in Combinatorics, Cambridge: Cambridge University Press, 1992."},{"key":"17_CR5","volume-title":"The Theory of Error-Correcting Codes","author":"F.J. MacWilliams","year":"1977","unstructured":"F.J. MacWilliams and N.J.A. Sloane, The Theory of Error-Correcting Codes, Amsterdam: North-Holland, 1977."},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/PL00003816","volume":"12","author":"P.C. Oorschot van","year":"1999","unstructured":"P.C. van Oorschot and M.J. Wiener, Parallel Collision Search with Cryptanalytic Applications, J. of Cryptology, Vol. 12, pp. 1\u201328, 1999.","journal-title":"J. of Cryptology"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/TIT.1978.1055817","volume":"IT-24","author":"S. Pohlig","year":"1978","unstructured":"S. Pohlig and M. Hellman, An Improved Algorithm for Computing Logarithms in GF(p) and its Cryptographic Signi.cance, IEEE Trans. Inform. Theory, Vol. IT-24, pp. 106\u2013111, January 1978.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"143","key":"17_CR8","doi-asserted-by":"publisher","first-page":"918","DOI":"10.2307\/2006496","volume":"32","author":"J.M. Pollard","year":"1978","unstructured":"J.M. Pollard, Monte Carlo Methods for Index Computation ( mod p), Mathematics of Computation, Vol. 32, No. 143, pp. 918\u2013924, July 1978.","journal-title":"Mathematics of Computation"},{"key":"17_CR9","volume-title":"presented at ECC 2000-The Fourth Workshop on Elliptic Curve Cryptography","author":"E. Schulte-Geers","year":"2000","unstructured":"E. Schulte-Geers, Collision Search in a Random Mapping: Some Asymptotic Results, presented at ECC 2000-The Fourth Workshop on Elliptic Curve Cryptography, University of Essen, Germany, October 4-6, 2000."},{"key":"17_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1007\/3-540-69053-0_18","volume-title":"Advances in Cryptology\u2014EUROCRYPT\u2019 97","author":"V. Shoup","year":"1997","unstructured":"V. Shoup, Lower Bounds for Discrete Logarithms and Related Problems, in Advances in Cryptology\u2014EUROCRYPT\u2019 97, W. Fumy, Ed., Lecture Notes in Computer Science, Vol. 1233, pp. 256\u2013266, Berlin: Springer, 1997."},{"key":"17_CR11","unstructured":"R. Silverman and J. Stapleton, Contribution to ANSI X9F1 working group, December 1997."},{"key":"17_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/BFb0054874","volume-title":"Proceedings of ANTS III-The 3rd International Symposium on Algorithmic Number Theory","author":"E. Teske","year":"1998","unstructured":"E. Teske, Speeding up Pollard\u2019s Rho Method for Computing Discrete Logarithms, in Proceedings of ANTS III-The 3rd International Symposium on Algorithmic Number Theory, J.P. Buhler, Ed., Lecture Notes in Computer Science, Vol. 1423, pp. 351\u2013357, Berlin: Springer, 1998."},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1090\/S0025-5718-00-01213-8","volume":"70","author":"E. Teske","year":"2001","unstructured":"E. Teske, On Random Walks for Pollard\u2019s Rho Method, Mathematics of Computation, Vol. 70, pp. 809\u2013825, 2001.","journal-title":"Mathematics of Computation"},{"key":"17_CR14","unstructured":"E. Teske, Square-Root Algorithms for the Discrete Logarithm Problem (A Survey), Technical Report CORR 2001-07, Centre for Applied Cryptographic Research, University of Waterloo, 2001."},{"key":"17_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/3-540-48892-8_15","volume-title":"Proceedings of SAC\u201998-Fifth Annual Workshop on Selected Areas in Cryptography","author":"M.J. Wiener","year":"1998","unstructured":"M.J. Wiener and R.J. Zuccherato, Faster Attacks on Elliptic Curve Cryptosystems, in Proceedings of SAC\u201998-Fifth Annual Workshop on Selected Areas in Cryptography, E. Tavares, H. Meijer, Eds., Lecture Notes in Computer Science, Vol. 1556, pp. 190\u2013200, Berlin: Springer, 1998."}],"container-title":["Selected Areas in Cryptography","Lecture Notes in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45537-X_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T03:57:56Z","timestamp":1550375876000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45537-X_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540430667","9783540455370"],"references-count":15,"URL":"http:\/\/dx.doi.org\/10.1007\/3-540-45537-x_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"published":{"date-parts":[[2001]]}}}