{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:16:21Z","timestamp":1759637781854},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540705826"},{"type":"electronic","value":"9783540705833"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70583-3_36","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"437-448","source":"Crossref","is-referenced-by-count":4,"title":["On Black-Box Ring Extraction and Integer Factorization"],"prefix":"10.1007","author":[{"given":"Kristina","family":"Altmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tibor","family":"Jager","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andy","family":"Rupp","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"36_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/3-540-68697-5_22","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"D. Boneh","year":"1996","unstructured":"Boneh, D., Lipton, R.J.: Algorithms for black-box fields and their application to cryptography (extended abstract). In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 283\u2013297. Springer, Heidelberg (1996)"},{"key":"36_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/978-3-540-76900-2_26","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2007","author":"U. Maurer","year":"2007","unstructured":"Maurer, U., Raub, D.: Black-box extension fields and the inexistence of field-homomorphic one-way permutations. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol.\u00a04833, pp. 427\u2013443. Springer, Heidelberg (2007)"},{"issue":"2","key":"36_CR3","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/BF02113297","volume":"55","author":"V.I. Nechaev","year":"1994","unstructured":"Nechaev, V.I.: Complexity of a determinate algorithm for the discrete logarithm. Mathematical Notes\u00a055(2), 165\u2013172 (1994)","journal-title":"Mathematical Notes"},{"key":"36_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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)"},{"key":"36_CR5","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"IMA Int. Conf.","author":"U. Maurer","year":"2005","unstructured":"Maurer, U.: Abstract models of computation in cryptography. In: Smart, N.P. (ed.) IMA Int. Conf. LNCS, vol.\u00a03796, pp. 1\u201312. Springer, Heidelberg (2005)"},{"key":"36_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/3-540-48658-5_26","volume-title":"Advances in Cryptology - CRYPTO \u201994","author":"U. Maurer","year":"1994","unstructured":"Maurer, U.: Towards the equivalence of breaking the Diffie-Hellman protocol and computing discrete algorithms. In: Desmedt, Y. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 271\u2013281. Springer, Heidelberg (1994)"},{"key":"36_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1007\/0-387-34799-2_38","volume-title":"Advances in Cryptology - CRYPTO \u201988","author":"B. Boer den","year":"1990","unstructured":"den Boer, B.: Diffie-Hellman is as strong as discrete log for certain primes. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol.\u00a0403, pp. 530\u2013539. Springer, Heidelberg (1990)"},{"key":"36_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/BFb0054118","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"U.M. Maurer","year":"1998","unstructured":"Maurer, U.M., Wolf, S.: Lower bounds on generic algorithms in groups. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 72\u201384. Springer, Heidelberg (1998)"},{"key":"36_CR9","unstructured":"Bach, E.: Discrete logarithms and factoring. Technical Report UCB\/CSD-84-186, EECS Department, University of California, Berkeley (June 1984)"},{"key":"36_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/11935230_16","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2007","author":"G. Leander","year":"2006","unstructured":"Leander, G., Rupp, A.: On the equivalence of RSA and factoring regarding generic ring algorithms. In: Lai, X., Chen, K. (eds.) Advances in Cryptology \u2014 ASIACRYPT 2007. LNCS, vol.\u00a04284, pp. 241\u2013251. Springer, Heidelberg (2006)"},{"key":"36_CR11","unstructured":"Altmann, K., Jager, T., Rupp, A.: On black-box ring extraction and integer factorization. Cryptology ePrint Archive, Report 2008\/156 (2008), \n                      \n                        http:\/\/eprint.iacr.org\/"},{"key":"36_CR12","unstructured":"Shoup, V.: Sequences of games: a tool for taming complexity in security proofs. Cryptology ePrint Archive, Report 2004\/332 (2004), \n                      \n                        http:\/\/eprint.iacr.org\/"},{"key":"36_CR13","series-title":"Graduate Studies in Math","doi-asserted-by":"crossref","DOI":"10.1090\/gsm\/003","volume-title":"An introduction to Gr\u00f6bner bases","author":"W. Adams","year":"1994","unstructured":"Adams, W., Loustaunau, P.: An introduction to Gr\u00f6bner bases. Graduate Studies in Math, vol.\u00a03. Oxford University Press, Oxford (1994)"},{"key":"36_CR14","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0001-8708(82)90048-2","volume":"46","author":"E.W. Mayr","year":"1982","unstructured":"Mayr, E.W., Meyer, A.: The complexity of the word problems for commutative semigroups and polynomial ideals. Advances in Mathematics\u00a046, 305\u2013329 (1982)","journal-title":"Advances in Mathematics"},{"key":"36_CR15","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"STACS 2005","author":"M. Agrawal","year":"2005","unstructured":"Agrawal, M., Saxena, N.: Automorphisms of finite rings and applications to complexity of problems. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol.\u00a03404, pp. 1\u201317. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70583-3_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:23:36Z","timestamp":1620015816000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70583-3_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540705826","9783540705833"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70583-3_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}