{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T00:54:14Z","timestamp":1730249654328,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,5]]},"DOI":"10.1109\/icmcs.2012.6320288","type":"proceedings-article","created":{"date-parts":[[2013,5,15]],"date-time":"2013-05-15T17:01:35Z","timestamp":1368637295000},"page":"923-927","source":"Crossref","is-referenced-by-count":2,"title":["Improving Pollard's Rho attack on elliptic curve cryptosystems"],"prefix":"10.1109","author":[{"given":"Siham","family":"Ezzouak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammed","family":"Elamrani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdelmalek","family":"Azizi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"13","first-page":"541554","article-title":"Guide to Elliptic Curve Cryptography","volume":"1423","author":"hankerson","year":"1998","journal-title":"LNCS"},{"key":"11","first-page":"541","article-title":"Speeding up Pollards rho Method for Computing Discrete Logarithms","volume":"1423","author":"teske","year":"1998","journal-title":"LNCS"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-00-01213-8"},{"key":"3","first-page":"7","article-title":"Seminumerical Algorithms","volume":"2","author":"knuth","year":"1969","journal-title":"The art of computer programming"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01933190"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.2307\/2006496"},{"key":"10","first-page":"128","article-title":"Parallel Collision Search with Cryptanalytic Applications","volume":"12","author":"van oorschot","year":"1999","journal-title":"Journal of Cryptology The journal of the International Association for Cryptologic Research"},{"key":"7","first-page":"43","author":"giuliani","year":"1999","journal-title":"Attacks on the Elliptic Curve Discrete Logarithm Problem"},{"journal-title":"Cycle Detection Using A Stack","year":"2004","author":"nivasch","key":"6"},{"journal-title":"Square-Root Methods for the Discrete Logarithm Problem","year":"2010","author":"harrison","key":"5"},{"key":"4","first-page":"415","article-title":"Class number, a theory of factorisation and genera","author":"shanks","year":"1971","journal-title":"Lecture Notes in Computer Science"},{"journal-title":"SAGE Mathematics Software","year":"2010","author":"stein","key":"9"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1987-0866109-5"}],"event":{"name":"2012 International Conference on Multimedia Computing and Systems (ICMCS)","start":{"date-parts":[[2012,5,10]]},"location":"Tangiers, Morocco","end":{"date-parts":[[2012,5,12]]}},"container-title":["2012 International Conference on Multimedia Computing and Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6308061\/6320104\/06320288.pdf?arnumber=6320288","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T19:22:46Z","timestamp":1490124166000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6320288\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/icmcs.2012.6320288","relation":{},"subject":[],"published":{"date-parts":[[2012,5]]}}}