{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:17:52Z","timestamp":1725491872922},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540741237"},{"type":"electronic","value":"9783540741244"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-74124-4_24","type":"book-chapter","created":{"date-parts":[[2007,9,13]],"date-time":"2007-09-13T03:06:39Z","timestamp":1189652799000},"page":"355-374","source":"Crossref","is-referenced-by-count":5,"title":["An Elliptic Curve Backdoor Algorithm for RSASSA"],"prefix":"10.1007","author":[{"given":"Adam","family":"Young","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moti","family":"Yung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Adleman, L.M., Manders, K., Miller, G.: On Taking Roots in Finite Fields. In: IEEE Foundations of Computer Science\u2014FOCS 1977, pp. 175\u2013177 (1977)","DOI":"10.1109\/SFCS.1977.18"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Anderson, R.J.: A Practical RSA Trapdoor. Elec. Letters 29(11) (1993)","DOI":"10.1049\/el:19930662"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: 1st Annual ACM CCCS, pp. 62\u201373 (1993)","DOI":"10.1145\/168588.168596"},{"key":"24_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/3-540-68339-9_34","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"M. Bellare","year":"1996","unstructured":"Bellare, M., Rogaway, P.: The Exact Security of Digital Signatures\u2014How to Sign with RSA and Rabin. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 399\u2013416. Springer, Heidelberg (1996)"},{"key":"24_CR5","unstructured":"Bellare, M., Rogaway, P.: PSS: Provably Secure Encoding Method for Digital Signatures. IEEE P1363 working group August 1998 (submission)"},{"key":"24_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1007\/11496618_14","volume-title":"Information Security and Cryptology \u2013 ICISC 2004","author":"J.M. Bohli","year":"2005","unstructured":"Bohli, J.M., Steinwandt, R.: On Subliminal Channels in Deterministic Signature Schemes. In: Park, C.-s., Chee, S. (eds.) ICISC 2004. LNCS, vol.\u00a03506, pp. 182\u2013194. Springer, Heidelberg (2005)"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Boneh, D.: The Decision Diffie-Hellman Problem. In: Third Algorithmic Number Theory Symposium, pp. 48\u201363 (1998)","DOI":"10.1007\/BFb0054851"},{"key":"24_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1007\/3-540-68339-9_16","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"D. Coppersmith","year":"1996","unstructured":"Coppersmith, D.: Finding a small root of a bivariate integer equation; Factoring with high bits known. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 178\u2013189. Springer, Heidelberg (1996)"},{"key":"24_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/3-540-36563-X_28","volume-title":"Topics in Cryptology - CT-RSA 2003","author":"C. Cr\u00e9peau","year":"2003","unstructured":"Cr\u00e9peau, C., Slakmon, A.: Simple Backdoors for RSA Key Generation. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol.\u00a02612, pp. 403\u2013416. Springer, Heidelberg (2003)"},{"issue":"6","key":"24_CR10","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"IT-22","author":"W. Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.: New Directions in Cryptography. IEEE Transactions on Information Theory\u00a0IT-22(6), 644\u2013654 (1976)","journal-title":"IEEE Transactions on Information Theory"},{"key":"24_CR11","unstructured":"NIST. Announcing Draft FIPS 180-2, Secure Hash Standard, and RFC. Federal Register, vol. 66(104), p. 29287 (2001)"},{"key":"24_CR12","unstructured":"NIST. Announcing Approval of FIPS 180-2, Secure Hash Standard; a Revision of FIPS 180-2. Federal Register, vol. 67(165), pp. 54785\u201354787 (2002)"},{"issue":"1","key":"24_CR13","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s00145-001-0011-x","volume":"15","author":"P. Gaudry","year":"2002","unstructured":"Gaudry, P., Hess, F., Smart, N.: Constructive and Destructive Facets of Weil Descent on Elliptic Curves. Journal of Cryptology\u00a015(1), 19\u201346 (2002)","journal-title":"Journal of Cryptology"},{"key":"24_CR14","unstructured":"IEEE P1363 working group. IEEE P1363a D10: Standard Specifications for Public Key Cryptography: Additional Techniques (November 1, 2001), available from http:\/\/grouper.ieee.org\/groups\/1363\/"},{"issue":"4","key":"24_CR15","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s00145-003-0052-4","volume":"16","author":"A. Joux","year":"2003","unstructured":"Joux, A., Nguyen, K.: Separating DDH from CDH in Cryptographic Groups. Journal of Cryptology\u00a016(4), 239\u2013247 (2003)","journal-title":"Journal of Cryptology"},{"key":"24_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1007\/3-540-47721-7_7","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"B.S. Kaliski","year":"1987","unstructured":"Kaliski, B.S.: A Pseudo-Random Bit Generator Based on Elliptic Logarithms. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 84\u2013103. Springer, Heidelberg (1987)"},{"key":"24_CR17","unstructured":"Kaliski, B.S.: Elliptic Curves and Cryptography: A Pseudorandom Bit Generator and Other Tools. PhD Thesis, MIT (February 1988)"},{"issue":"3","key":"24_CR18","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/BF00196911","volume":"3","author":"B.S. Kaliski","year":"1991","unstructured":"Kaliski, B.S.: One-Way Permutations on Elliptic Curves. Journal of Cryptology\u00a03(3), 187\u2013199 (1991)","journal-title":"Journal of Cryptology"},{"key":"24_CR19","doi-asserted-by":"crossref","unstructured":"Luby, M.: Pseudorandomness and Cryptographic Applications. Princeton Computer Science Notes (1996)","DOI":"10.1515\/9780691206844"},{"key":"24_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/978-3-540-30108-0_21","volume-title":"Computer Security \u2013 ESORICS 2004","author":"B. M\u00f6ller","year":"2004","unstructured":"M\u00f6ller, B.: A Public-Key Encryption Scheme with Pseudo-Random Ciphertexts. In: Samarati, P., Ryan, P.Y A., Gollmann, D., Molva, R. (eds.) ESORICS 2004. LNCS, vol.\u00a03193, pp. 335\u2013351. Springer, Heidelberg (2004)"},{"key":"24_CR21","unstructured":"PKCS #1 v2.1: RSA Cryptography Standard. RSA Labs (June 14, 2002)"},{"key":"24_CR22","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1137\/0209024","volume":"9","author":"M. Rabin","year":"1980","unstructured":"Rabin, M.: Probabilistic Algorithms in Finite Fields. SIAM Journal on Computing\u00a09, 273\u2013280 (1980)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"24_CR23","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. Rivest","year":"1978","unstructured":"Rivest, R., Shamir, A., Adleman, L.: A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. CACM\u00a021(2), 120\u2013126 (1978)","journal-title":"CACM"},{"key":"24_CR24","series-title":"Lecture Notes in Computer Science","first-page":"19","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"X. Wang","year":"2005","unstructured":"Wang, X., Yu, H.: How to Break MD5 and Other Hash Functions. In: Cramer, R.J.F. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 19\u201335. Springer, Heidelberg (2005)"},{"key":"24_CR25","series-title":"Lecture Notes in Computer Science","first-page":"17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"X. Wang","year":"2005","unstructured":"Wang, X., Ying, Y., Yu, H.: Finding Collisions in the Full SHA-1. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 17\u201336. Springer, Heidelberg (2005)"},{"key":"24_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/3-540-68697-5_8","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"A. Young","year":"1996","unstructured":"Young, A., Yung, M.: The Dark Side of Black-Box Cryptography, or: Should we trust Capstone? In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 89\u2013103. Springer, Heidelberg (1996)"},{"key":"24_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/3-540-69053-0_6","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"A. Young","year":"1997","unstructured":"Young, A., Yung, M.: Kleptography: Using Cryptography Against Cryptography. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 62\u201374. Springer, Heidelberg (1997)"},{"key":"24_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1007\/BFb0052241","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"A. Young","year":"1997","unstructured":"Young, A., Yung, M.: The Prevalence of Kleptographic Attacks on Discrete-Log Based Cryptosystems. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 264\u2013276. Springer, Heidelberg (1997)"},{"key":"24_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/11693383_9","volume-title":"Selected Areas in Cryptography","author":"A. Young","year":"2006","unstructured":"Young, A., Yung, M.: A Space Efficient Backdoor in RSA and its Applications. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol.\u00a03897, pp. 128\u2013143. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Information Hiding"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74124-4_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,26]],"date-time":"2020-04-26T13:29:47Z","timestamp":1587907787000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74124-4_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540741237","9783540741244"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74124-4_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}