{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:40:38Z","timestamp":1743090038194,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642278891"},{"type":"electronic","value":"9783642278907"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-27890-7_8","type":"book-chapter","created":{"date-parts":[[2012,2,27]],"date-time":"2012-02-27T05:50:53Z","timestamp":1330321853000},"page":"98-108","source":"Crossref","is-referenced-by-count":2,"title":["Solving a DLP with Auxiliary Input with the \u03c1-Algorithm"],"prefix":"10.1007","author":[{"given":"Yumi","family":"Sakemi","sequence":"first","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":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-540-30539-2_8","volume-title":"Advances in Cryptology - ASIACRYPT 2004","author":"K. Aoki","year":"2004","unstructured":"Aoki, K., Ueda, H.: Sieving Using Bucket Sort. In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol.\u00a03329, pp. 92\u2013102. Springer, Heidelberg (2004)"},{"key":"8_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":"8_CR3","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":"8_CR4","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.: Hierarchical Identity Based Encryption with Constant Size Ciphertext. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 440\u2013456. Springer, Heidelberg (2005)"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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)"},{"issue":"4","key":"8_CR6","first-page":"315","volume":"16","author":"R. Box","year":"1991","unstructured":"Box, R., et al.: A Fast Easy Sort. Computer Journal of Byte Magazine\u00a016(4), 315\u2013320 (1991)","journal-title":"Computer Journal of Byte Magazine"},{"key":"8_CR7","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":"8_CR8","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"},{"key":"8_CR9","unstructured":"GNU MP, \n                  \n                    http:\/\/gmplib.org\/"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Izu, T., Takenaka, M., Yasuda, M.: Experimental Results on Cheon\u2019s Algorithm. In: WAIS 2010, The Proceedings of ARES 2010, pp. 625\u2013630. IEEE Computer Science (2010)","DOI":"10.1109\/ARES.2010.55"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Izu, T., Takenaka, M., Yasuda, M.: Experimental Analysis of Cheon\u2019s Algorithm against Pairing-Friendly Curves. In: AINA 2011, pp. 90\u201396. IEEE Computer Science (2011)","DOI":"10.1109\/AINA.2011.37"},{"key":"8_CR12","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":"8_CR13","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)"},{"issue":"177","key":"8_CR14","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1090\/S0025-5718-1987-0866113-7","volume":"48","author":"P. Montgomery","year":"1987","unstructured":"Montgomery, P.: Speeding the Pollard and Elliptic Curve Methods of Factorization. Math. Comp.\u00a048(177), 243\u2013264 (1987)","journal-title":"Math. Comp."},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Oliveira, L., L\u00f3pez, J., Dahab, R.: TinyTate: Identity-Based Encryption for Sensor Networks. IACR Cryptology ePrint Archive, Report 2007\/020 (2007)","DOI":"10.1109\/PERCOMW.2007.56"},{"key":"8_CR16","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."},{"key":"8_CR17","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":"8_CR18","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)","DOI":"10.1090\/pspum\/020\/0316385"},{"key":"8_CR19","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)"}],"container-title":["Lecture Notes in Computer Science","Information Security Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-27890-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T02:32:08Z","timestamp":1556418728000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-27890-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642278891","9783642278907"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-27890-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}