{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T04:54:24Z","timestamp":1725684864601},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642300561"},{"type":"electronic","value":"9783642300578"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30057-8_35","type":"book-chapter","created":{"date-parts":[[2012,5,18]],"date-time":"2012-05-18T17:05:50Z","timestamp":1337360750000},"page":"595-608","source":"Crossref","is-referenced-by-count":11,"title":["Solving a Discrete Logarithm Problem with Auxiliary Input on a 160-Bit Elliptic Curve"],"prefix":"10.1007","author":[{"given":"Yumi","family":"Sakemi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Goichiro","family":"Hanaoka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tetsuya","family":"Izu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masahiko","family":"Takenaka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masaya","family":"Yasuda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"35_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-540-24676-3_14","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"D. Boneh","year":"2004","unstructured":"Boneh, D., Boyen, X.: Efficient Selective-ID Secure Identity-Based Encryption Without Random Oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 223\u2013238. Springer, Heidelberg (2004)"},{"key":"35_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-540-24676-3_4","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"D. Boneh","year":"2004","unstructured":"Boneh, D., Boyen, X.: Short Signatures Without Random Oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 56\u201373. Springer, Heidelberg (2004)"},{"key":"35_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/11426639_26","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"D. Boneh","year":"2005","unstructured":"Boneh, D., Boyen, X., Goh, E.-J.: Hierarchical Identity Based Encryption with Constant Size Ciphertext. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 440\u2013456. Springer, Heidelberg (2005)"},{"key":"35_CR4","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":"35_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1007\/11535218_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"D. Boneh","year":"2005","unstructured":"Boneh, D., Gentry, C., Waters, B.: Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 258\u2013275. Springer, Heidelberg (2005)"},{"key":"35_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/11693383_22","volume-title":"Selected Areas in Cryptography","author":"P.S.L.M. Barreto","year":"2006","unstructured":"Barreto, P.S.L.M., Naehrig, M.: Pairing-Friendly Elliptic Curves of Prime Order. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol.\u00a03897, pp. 319\u2013331. Springer, Heidelberg (2006)"},{"unstructured":"Bos, J.W., Kaihara, M.E., Kleinjung, T., Lenstra, A.K., Montgomery, P.L.: PlayStation 3 Computing Breaks 260 Barrier 112-bit Prime ECDLP Solved (2009), \n                    \n                      http:\/\/lacal.epfl.ch\/112bit_prime","key":"35_CR7"},{"key":"35_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11761679_1","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"J.H. Cheon","year":"2006","unstructured":"Cheon, J.H.: Security Analysis of the Strong Diffie-Hellman Problem. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 1\u201311. Springer, Heidelberg (2006)"},{"issue":"3","key":"35_CR9","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/s00145-009-9047-0","volume":"23","author":"J.H. Cheon","year":"2010","unstructured":"Cheon, J.H.: Discrete Logarithm Problems with Auxiliary Inputs. Journal of Cryptology\u00a023(3), 457\u2013476 (2010)","journal-title":"Journal of Cryptology"},{"unstructured":"Distributed.net, \n                    \n                      http:\/\/www.distributed.net\/Main_Page\/","key":"35_CR10"},{"key":"35_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-642-13013-7_22","volume-title":"Public Key Cryptography \u2013 PKC 2010","author":"S.D. Galbraith","year":"2010","unstructured":"Galbraith, S.D., Ruprai, R.S.: Using Equivalence Classes to Accelerate Solving the Discrete Logarithm Problem in a Short Interval. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol.\u00a06056, pp. 368\u2013383. Springer, Heidelberg (2010)"},{"key":"35_CR12","doi-asserted-by":"publisher","first-page":"1699","DOI":"10.1090\/S0025-5718-99-01119-9","volume":"69","author":"R.P. Gallant","year":"2000","unstructured":"Gallant, R.P., Lambert, R.J., Vanstone, S.A.: Improving the Parallelized Pollard Lambda Search on Binary Anomalous Curves. Math. Comp.\u00a069, 1699\u20131705 (2000)","journal-title":"Math. Comp."},{"key":"35_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/3-540-44647-8_11","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"R.P. Gallant","year":"2001","unstructured":"Gallant, R.P., Lambert, R.J., Vanstone, S.A.: Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 190\u2013200. Springer, Heidelberg (2001)"},{"key":"35_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/11761679_27","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"C. Gentry","year":"2006","unstructured":"Gentry, C.: Practical Identity-Based Encryption Without Random Oracles. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 445\u2013464. Springer, Heidelberg (2006)"},{"doi-asserted-by":"crossref","unstructured":"Izu, T., Takenaka, M., Yasuda, M.: Experimental Results on Cheon\u2019s Algorithm. In: WAIS 2010, Proceedings of ARES 2010, pp. 625\u2013630. IEEE Computer Science (2010)","key":"35_CR15","DOI":"10.1109\/ARES.2010.55"},{"key":"35_CR16","doi-asserted-by":"publisher","first-page":"441","DOI":"10.2197\/ipsjjip.19.441","volume":"19","author":"T. Izu","year":"2011","unstructured":"Izu, T., Takenaka, M., Yasuda, M.: Experimental Analysis of Cheon\u2019s Algorithm against Pairing-friendly Curves. Journal of Information Processing\u00a019, 441\u2013450 (2011)","journal-title":"Journal of Information Processing"},{"key":"35_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-03298-1_1","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2009","author":"D. Jao","year":"2009","unstructured":"Jao, D., Yoshida, K.: Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem. In: Shacham, H., Waters, B. (eds.) Pairing 2009. LNCS, vol.\u00a05671, pp. 1\u201316. Springer, Heidelberg (2009)"},{"key":"35_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/978-3-540-73489-5_17","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2007","author":"S. Kozaki","year":"2007","unstructured":"Kozaki, S., Kutsuma, T., Matsuo, K.: Remarks on Cheon\u2019s Algorithms for Pairing-Related Problems. In: Takagi, T., Okamoto, T., Okamoto, E., Okamoto, T. (eds.) Pairing 2007. LNCS, vol.\u00a04575, pp. 302\u2013316. Springer, Heidelberg (2007)"},{"key":"35_CR19","first-page":"918","volume":"32","author":"J. Pollard","year":"1978","unstructured":"Pollard, J.: Monte Carlo Methods for Index Computation (\n                    \n                      \n                    \n                    $\\bmod~p$\n                  ). Math. Comp.\u00a032, 918\u2013924 (1978)","journal-title":"Math. Comp."},{"doi-asserted-by":"crossref","unstructured":"Shanks, D.: Class Number, a Theory of Factorization, and Genera. In: Proc. of Symp. Math. Soc., vol.\u00a020, pp. 41\u2013440 (1971)","key":"35_CR20","DOI":"10.1090\/pspum\/020\/0316385"},{"key":"35_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/978-3-642-21040-2_8","volume-title":"Information Security Theory and Practice. Security and Privacy of Mobile Devices in Wireless Communication","author":"Y. Sakemi","year":"2011","unstructured":"Sakemi, Y., Izu, T., Takenaka, M., Yasuda, M.: Solving DLP with Auxiliary Input over an Elliptic Curve Used in TinyTate Library. In: Ardagna, C.A., Zhou, J. (eds.) WISTP 2011. LNCS, vol.\u00a06633, pp. 116\u2013127. Springer, Heidelberg (2011)"},{"key":"35_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-642-27890-7_8","volume-title":"Information Security Applications","author":"Y. Sakemi","year":"2012","unstructured":"Sakemi, Y., Izu, T., Takenaka, M., Yasuda, M.: Solving a DLP with Auxiliary Input with the \u03c1-Algorithm. In: Jung, S., Yung, M. (eds.) WISA 2011. LNCS, vol.\u00a07115, pp. 98\u2013108. Springer, Heidelberg (2012)"},{"key":"35_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 III. LNCS, vol.\u00a01423, pp. 541\u2013554. Springer, Heidelberg (1998)"},{"key":"35_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."}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography \u2013 PKC 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30057-8_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:26:08Z","timestamp":1620127568000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30057-8_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642300561","9783642300578"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30057-8_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}