{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T09:42:58Z","timestamp":1725529378123},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642004674"},{"type":"electronic","value":"9783642004681"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-00468-1_4","type":"book-chapter","created":{"date-parts":[[2009,3,11]],"date-time":"2009-03-11T10:54:35Z","timestamp":1236768875000},"page":"54-67","source":"Crossref","is-referenced-by-count":1,"title":["Subset-Restricted Random Walks for Pollard rho Method on ${\\mathbf{F}_{p^m}}$"],"prefix":"10.1007","author":[{"given":"Minkyu","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jung Hee","family":"Cheon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jin","family":"Hong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","unstructured":"Memoirs of the 3rd Cryptology Paper Contest, arranged by a Korean government organization (written in Korean) (2007)"},{"key":"4_CR2","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":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-44647-8_13","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"D. Boneh","year":"2001","unstructured":"Boneh, D., Franklin, M.: Identity-based encryption from the Weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 213\u2013229. Springer, Heidelberg (2001)"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s00145-004-0314-9","volume":"17","author":"D. Boneh","year":"2004","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short Signatures from the Weil Pairing. J. Cryptology\u00a017, 297\u2013319 (2004)","journal-title":"J. Cryptology"},{"key":"4_CR5","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"},{"issue":"4","key":"4_CR6","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1109\/TIT.1984.1056941","volume":"30","author":"D. Coppersmith","year":"1984","unstructured":"Coppersmith, D.: Fast Evaluation of Logarithms in Fields of Characteristic Two. IEEE Trans. Inform. Theory\u00a030(4), 587\u2013594 (1984)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/978-3-540-89255-7_29","volume-title":"Asiacrypt 2008","author":"J. Cheon","year":"2008","unstructured":"Cheon, J., Hong, J., Kim, M.: Speeding up Pollard Rho Method on Prime Fields. In: Asiacrypt 2008. LNCS, vol.\u00a05350, pp. 471\u2013488. Springer, Heidelberg (2008)"},{"key":"4_CR8","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":"4_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":"4_CR10","first-page":"865","volume":"62","author":"G. Frey","year":"1994","unstructured":"Frey, G., R\u00fcck, H.-G.: A remark concerning m-divisibility and the discrete logarithm problem in the divisor class group of curves. Math. Comp.\u00a062, 865\u2013874 (1994)","journal-title":"Math. Comp."},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/3-540-45682-1_29","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"S. Galbraith","year":"2001","unstructured":"Galbraith, S.: Supersingular Curves in Cryptography. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 495\u2013513. Springer, Heidelberg (2001)"},{"key":"4_CR12","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."},{"issue":"5","key":"4_CR13","doi-asserted-by":"publisher","first-page":"1636","DOI":"10.1109\/18.259647","volume":"39","author":"A. Menezes","year":"1993","unstructured":"Menezes, A., Okamoto, T., Vanstone, P.: Reducing elliptic curve logarithms to logarithms in a finite field. IEEE Trans. Inform. Theory\u00a039(5), 1636\u20131649 (1993)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4_CR14","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"},{"issue":"143","key":"4_CR15","first-page":"918","volume":"32","author":"J. Pollard","year":"1978","unstructured":"Pollard, J.: A Monte Carlo Method for Index Computation (mod p). Math. Comp.\u00a032(143), 918\u2013924 (1978)","journal-title":"Math. Comp."},{"key":"4_CR16","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":"4_CR17","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."},{"key":"4_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/3-540-69053-0_18","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"V. Shoup","year":"1997","unstructured":"Shoup, V.: Lower Bounds for Discrete Logarithms and Related Problems. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 256\u2013266. Springer, Heidelberg (1997)"},{"issue":"167","key":"4_CR19","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."},{"issue":"6","key":"4_CR20","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1006\/jsco.1999.0309","volume":"29","author":"S. Gao","year":"2000","unstructured":"Gao, S., von zur Gathen, J., Panario, D., Shoup, V.: Algorithms for Exponentiation in Finite Fields. Journal of Symbolic Computation\u00a029(6), 879\u2013889 (2000)","journal-title":"Journal of Symbolic Computation"},{"key":"4_CR21","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 Gro\u00dfer Zahlen. Computing\u00a07, 281\u2013292 (1971)","journal-title":"Computing"},{"key":"4_CR22","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/BF00289470","volume":"7","author":"A. Sch\u00f6nhage","year":"1977","unstructured":"Sch\u00f6nhage, A.: Schnelle Multiplikation von Polynomen \u00fcber K\u00f6rpern der Charakteristik 2. Acta Informatica\u00a07, 395\u2013398 (1977)","journal-title":"Acta Informatica"},{"issue":"2","key":"4_CR23","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":"4_CR24","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":"4_CR25","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":"4_CR26","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":"4_CR27","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","Public Key Cryptography \u2013 PKC 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00468-1_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,6]],"date-time":"2019-03-06T18:25:27Z","timestamp":1551896727000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00468-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642004674","9783642004681"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00468-1_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}