{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:05:11Z","timestamp":1725483911578},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540001713"},{"type":"electronic","value":"9783540361787"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36178-2_19","type":"book-chapter","created":{"date-parts":[[2007,5,3]],"date-time":"2007-05-03T17:30:14Z","timestamp":1178213414000},"page":"299-310","source":"Crossref","is-referenced-by-count":12,"title":["The Hardness of Hensel Lifting: The Case of RSA and Discrete Logarithm"],"prefix":"10.1007","author":[{"given":"Dario","family":"Catalano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Phong Q.","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jacques","family":"Stern","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,11,8]]},"reference":[{"key":"19_CR1","unstructured":"E. Bach and J. Shallit Algorithmic Number Theory, Vol. 1: Efficient Algorithms. MIT Press, 1996."},{"issue":"4","key":"19_CR2","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"M. Blum and S. Micali. How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits. SIAM Journal on Computing, Vol. 13, No. 4:850\u2013864, 1984.","journal-title":"SIAM Journal on Computing"},{"key":"19_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/3-540-44987-6_15","volume-title":"Advances in Cryptology-Eurocrypt\u2019 01","author":"D. Catalano","year":"2001","unstructured":"D. Catalano, R. Gennaro and N. Howgrave-Graham. The Bit Security of Paillier\u2019s Encryption Scheme and its Applications. In Advances in Cryptology-Eurocrypt\u2019 01. LNCS vol. 2045, Springer, 2001, pages 229\u2013243."},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"D. Catalano, R. Gennaro, N. Howgrave-Graham and P. Q. Nguyen. Paillier\u2019s Cryptosystem Revisited. In 8th ACM Conference on Computer and Communication Security pp. 206\u2013214, 2001.","DOI":"10.1145\/502010.502012"},{"key":"19_CR5","unstructured":"H. Cohen. A Course in Computational Algebraic Number Theory. Graduate Texts in Mathematics, Vol 138, Springer, 1996."},{"key":"19_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-44586-2_9","volume-title":"Public key Cryptography","author":"I. Damg\u00e5rd","year":"2001","unstructured":"I. Damg\u00e5rd and M. Jurik. A Generalization, a Simplification and Some Applications of Paillier\u2019s Probabilistic Public-Key System. In Public key Cryptography, LNCS vol. 1992, 2001, pages 119\u2013136."},{"issue":"2","key":"19_CR7","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s001459910008","volume":"13","author":"R. Fischlin","year":"2000","unstructured":"R. Fischlin and C.P. Schnorr. Stronger Security Proofs for RSA and Rabin Bits. J. of Cryptology, 13(2):221\u2013244, Spring 2000.","journal-title":"J. of Cryptology"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"F. Gouvea. p-adic numbers. Universitext, Springer, 1997.","DOI":"10.1007\/978-3-642-59058-0"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e1sz and A. Schrijver. Geometric Algorithms and Combinatorial Optimization. Springer-Verlag, 1993.","DOI":"10.1007\/978-3-642-78240-4"},{"key":"19_CR10","series-title":"Lect Notes Comput Sci","volume-title":"Proc. of CALC\u2019 01","author":"P. Q. Nguyen","year":"2001","unstructured":"P. Q. Nguyen and J. Stern. The two faces of lattices in cryptology. In Proc. of CALC\u2019 01, volume 2146 of LNCS, Springer-Verlag, 2001."},{"key":"19_CR11","series-title":"Lect Notes Comput Sci","first-page":"223","volume-title":"Advances in Cryptology-Eurocrypt\u2019 99","author":"P. Paillier","year":"1997","unstructured":"P. Paillier. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In Advances in Cryptology-Eurocrypt\u2019 99, LNCS vol. 1592, Springer, 1997, pages 223\u2013238."},{"key":"19_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45664-3_1","volume-title":"Public key Cryptography","author":"K. Sakurai","year":"2002","unstructured":"K. Sakurai and T. Takagi. New Semantically Secure Public-Key Cryptosystems from the RSA Primitive In Public key Cryptography, LNCS vol. 2274, 2002, pages 1\u201316."},{"key":"19_CR13","series-title":"Lect Notes Comput Sci","volume-title":"Proc. of Crypto\u2019 97","author":"T. Takagi","year":"1997","unstructured":"T. Takagi Fast RSA type Cryptosystems Using n-adic Expansion. In Proc. of Crypto\u2019 97, volume 1294 of LNCS, Springer-Verlag, 1997."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 ASIACRYPT 2002"],"original-title":[],"link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/content\/pdf\/10.1007\/3-540-36178-2_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T17:40:56Z","timestamp":1556386856000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/10.1007\/3-540-36178-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540001713","9783540361787"],"references-count":13,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/3-540-36178-2_19","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}