{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:17:58Z","timestamp":1725488278425},"publisher-location":"New York, NY","reference-count":18,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9780387971964"},{"type":"electronic","value":"9780387347998"}],"license":[{"start":{"date-parts":[[1990,1,1]],"date-time":"1990-01-01T00:00:00Z","timestamp":631152000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/0-387-34799-2_9","type":"book-chapter","created":{"date-parts":[[2007,8,6]],"date-time":"2007-08-06T01:17:36Z","timestamp":1186363056000},"page":"100-117","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Computation of Approximate L-th Roots Modulo n and Application to Cryptography"],"prefix":"10.1007","author":[{"given":"Marc","family":"Girault","sequence":"first","affiliation":[]},{"given":"Philippe","family":"Toffin","sequence":"additional","affiliation":[]},{"given":"Brigitte","family":"Vall\u00e9e","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,12,1]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1137\/0217013","volume":"17","author":"W. Alexi","year":"1988","unstructured":"W. Alexi, B. Chor, O. Goldreich and C.P. Schnorr, \u201cRSA and Rabin functions: certain parts are as hard as the whole\u201d, SIAM J. Comp., Vol. 17, pp. 194\u2013209, 1988.","journal-title":"SIAM J. Comp."},{"key":"9_CR2","first-page":"61","volume-title":"Advances in Cryptology, Proc. of Crypto 82","author":"L. Blum","year":"1983","unstructured":"L. Blum, M. Blum and M. Shub, \u201cComparison of two pseudo-random number generators\u201d, Advances in Cryptology, Proc. of Crypto 82, Plenum press, New York, 1983, pp.61\u201378."},{"issue":"5","key":"9_CR3","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1109\/5.4443","volume":"76","author":"E. Brickell","year":"1988","unstructured":"E. Brickell and A. Odlyzko, \u201cCryptanalysis: a survey of recent results\u201d, Proc. of the IEEE, Vol. 76, no 5, May 1988, pp. 578\u2013593.","journal-title":"Proc. of the IEEE"},{"key":"9_CR4","series-title":"Lect Notes Comput Sci","first-page":"10","volume-title":"Proc. of Crypto\u2019 85","author":"E. Brickell","year":"1986","unstructured":"E. Brickell and J. Delaurentis, \u201cAn attack on a signature scheme proposed by Okamoto and Shiraishi\u201d, Proc. of Crypto\u2019 85, LNCS, Vol. 218, Springer-Verlag, 1986, pp.10\u201314."},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1090\/S0025-5718-1981-0595059-1","volume":"36","author":"J.D. Dixon","year":"1981","unstructured":"J.D. Dixon, \u201cAsymptotical fast factorization of integers\u201d, Math. Comp., Vol. 36, 1981, pp. 255\u2013260.","journal-title":"Math. Comp."},{"key":"9_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/3-540-39799-X_3","volume-title":"Advances in Cryptology, Proc. of Crypto\u2019 85","author":"W. Jonge De","year":"1986","unstructured":"W. De Jonge and D. Chaum, \u201cAttacks on some RSA signatures\u201d, Advances in Cryptology, Proc. of Crypto\u2019 85, LNCS, Vol. 218, Springer-Verlag, 1986, pp. 18\u201327."},{"key":"9_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/3-540-39118-5_20","volume-title":"Proc. of Eurocrypt\u2019 87","author":"M. Girault","year":"1988","unstructured":"M. Girault, \u201cHash-functions using modulo-n operations\u201d, Proc. of Eurocrypt\u2019 87, LNCS, Vol. 304, Springer-Verlag, 1988, pp. 217\u2013226."},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, S. Micali and P. Tong, \u201cWhy and how to establish a private code on a public network\u201d, Proc. of the 23rd IEEE FOCS, 1982, pp. 134\u2013144.","DOI":"10.1109\/SFCS.1982.100"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/BF01457454","volume":"261","author":"A.K. Lenstra","year":"1982","unstructured":"A.K. Lenstra, H.W. Lenstra and L. Lovasz, \u201cFactoring polynomials with integer coefficients\u201d, Mathematische Annalen, 1982, Vol. 261, pp. 513\u2013534.","journal-title":"Mathematische Annalen"},{"key":"9_CR10","first-page":"183","volume":"29","author":"M.A. Morrison","year":"1975","unstructured":"M.A. Morrison and J. Brillhart, \u201cA method of factorization and the factorization of F7\u201d, Math. Comput., Vol. 29, 1975, pp. 183\u2013205.","journal-title":"Math. Comput."},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1049\/el:19860395","volume":"22","author":"T. Okamoto","year":"1986","unstructured":"T. Okamoto, \u201cFast public-key cryptosystem using congruent polynomial equations\u201d, Electronics Letters, 1986, Vol.22, pp. 581\u2013582.","journal-title":"Electronics Letters"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1049\/el:19870577","volume":"23","author":"T. Okamoto","year":"1987","unstructured":"T. Okamoto, \u201cModification of a public-key cryptosystem\u201d. Electronics Letters, 1987, Vol. 23, pp.814\u2013815.","journal-title":"Electronics Letters"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"T. Okamoto and A. Shiraishi, \u201cA fast signature scheme based on quadratic inequalities\u201d, Proc. of the 1985 Symposium on Security and Privacy, Apr.1985, Oakland, CA.","DOI":"10.1109\/SP.1985.10026"},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R.L. Rivest","year":"1978","unstructured":"R.L. Rivest, A. Shamir and L. Adleman, \u201cA method for obtaining digital signatures and public-key cryptosystems\u201d, CACM, Vol. 21, no2, Feb. 1978, pp. 120\u2013126.","journal-title":"CACM"},{"key":"9_CR15","unstructured":"B. Vall\u00e9e \u201cInteger factorisation with quasi-uniform generation of small quadratic residues\u201d, presented at \u201cComputational Number Theory\u201d Conference, Bodwin College, Jul. 88; submitted to Compte Rendus de l\u2019 Acad\u00e9mie des Sciences de Paris (preprint available from the author)."},{"key":"9_CR16","unstructured":"B. Vall\u00e9e, M. Girault and P. Toffin, \u201cHow to break Okamoto\u2019s cryptosystem by reducing lattice bases\u201d, Proc. of Eurocrypt\u2019 88, to appear."},{"key":"9_CR17","unstructured":"B. Vall\u00e9e, M. Girault and P. Toffin, \u201cHow to guess L-th roots modulo n by reducing lattice bases\u201d, Proc. of Conference of ISSAC-88 and AAECC-6, Jul. 88, to appear."},{"key":"9_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/3-540-39568-7_17","volume-title":"Advances in Cryptology, Proc. of Crypto\u2019 84","author":"U.V. Vazirani","year":"1985","unstructured":"U.V. Vazirani and V.V. Vazirani, \u201cEfficient and secure pseudo-random number generation\u201d, Advances in Cryptology, Proc. of Crypto\u2019 84, LNCS, Vol. 196, Springer-Verlag, 1985, pp.193\u2013202."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO\u2019 88"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/0-387-34799-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,12]],"date-time":"2019-12-12T15:26:24Z","timestamp":1576164384000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/0-387-34799-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9780387971964","9780387347998"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/0-387-34799-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]},"assertion":[{"value":"1 December 2000","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}