{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T15:46:55Z","timestamp":1772207215887,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540164630","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-39799-x_1","type":"book-chapter","created":{"date-parts":[[2007,2,28]],"date-time":"2007-02-28T12:25:31Z","timestamp":1172665531000},"page":"3-13","source":"Crossref","is-referenced-by-count":12,"title":["Breaking the Ong-Schnorr-Shamir Signature Scheme for Quadratic Number Fields"],"prefix":"10.1007","author":[{"given":"Dennis","family":"Estes","sequence":"first","affiliation":[]},{"given":"Leonard M.","family":"Adleman","sequence":"additional","affiliation":[]},{"given":"Kireeti","family":"Kompella","sequence":"additional","affiliation":[]},{"given":"Kevin S.","family":"McCurley","sequence":"additional","affiliation":[]},{"given":"Gary L.","family":"Miller","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"H. Ong, C. P. Schnorr, and A. Shamir, \u201cAn Efficient Signature Scheme Based on Quadratic Equations,\u201d Proc. 16th ACM Symp. Theor. Comput. (1984) 208\u2013216.","DOI":"10.1145\/800057.808683"},{"key":"1_CR2","series-title":"Lect Notes Comput Sci","volume-title":"Efficient Signature Schemes based on Polynomial Equations","author":"H. Ong","year":"1984","unstructured":"H. Ong, C. P. Schnorr, and A. Shamir, \u201cEfficient Signature Schemes based on Polynomial Equations,\u201d to appear in Crypto 84, Lecture Notes in Computer Science, Springer-Verlag, N. Y., 1984."},{"key":"1_CR3","unstructured":"J. M. Pollard and C.-P. Schnorr, \u201cSolution of x2 + ky2 \u2261 m (mod n), with applications to digital signatures\u201d, preprint, 1985."},{"key":"1_CR4","unstructured":"J. Shallit, \u201cAn Exposition of Pollard\u2019s Algorithm for Quadratic Congruences,\u201d Technical Report 84-006, Department of Computer Science, University of Chicago, Dec. 1984."},{"key":"1_CR5","unstructured":"M. O. Rabin, \u201cDigitalized signatures and public-key functions as intractable as factorization,\u201d M.I.T. Laboratory for Computer Science, Technical report LCS\/TR-212, 1979."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO \u201985 Proceedings"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-39799-X_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:22:27Z","timestamp":1619572947000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-39799-X_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540164630"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/3-540-39799-x_1","relation":{},"subject":[]}}