The hardness of hensel lifting: The case of rsa and discrete logarithm

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2501, Issue , 2002, Pages 299-310

  Catalano, Dario ^a   Nguyen, Phong Q ^a   Stern, Jacques ^a  

^a ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

Discrete logarithm; Hensel; Lattice; Onewayness; Paillier; Public key; RSA

Indexed keywords

COMPUTATION THEORY; PUBLIC KEY CRYPTOGRAPHY; SECURITY OF DATA;

DISCRETE LOGARITHMS; HENSEL; LATTICE; ONEWAYNESS; PAILLIER; PUBLIC KEYS;

CRYPTOGRAPHY;

EID: 84958775045     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36178-2_19     Document Type: Conference Paper

References (13)

1. E. Bach and J. Shallit Algorithmic Number Theory, Vol.1: Efficient Algorithms. MIT Press, 1996.
2. M. Blum and S. Micali. How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits. SIAM Journal on Computing, Vol. 13, No. 4:850-864, 1984.
3. D. Catalano, R. Gennaro and N. Howgrave-Graham. The Bit Security of Paillier’s Encryption Scheme and its Applications. In Advances in Cryptology – Eurocrypt’01. LNCS vol.2045, Springer, 2001, pages 229-243.
4. D. Catalano, R. Gennaro, N. Howgrave-Graham and P. Q. Nguyen. Paillier’s Cryptosystem Revisited. In 8th ACM Conference on Computer and Communication Security pp.206-214, 2001.
5. H. Cohen. A Course in Computational Algebraic Number Theory. Graduate Texts in Mathematics, Vol 138, Springer, 1996.
6. I. Damgard and M. Jurik. A Generalization, a Simplification and Some Applications of Paillier’s Probabilistic Public-Key System. In Public key Cryptography, LNCS vol. 1992, 2001, pages 119-136.
7. R. Fischlin and C.P. Schnorr. Stronger Security Proofs for RSA and Rabin Bits. J. ofCryptolo gy, 13(2):221–244, Spring 2000.
8. F. Gouvea. p-adic numbers. Universitext, Springer, 1997.
9. M. Grotschel, L. Lovasz and A. Schrijver. Geometric Algorithms and Combinatorial Optimization. Springer-Verlag, 1993.
10. P. Q. Nguyen and J. Stern. The two faces of lattices in cryptology. In Proc. Of CALC’01, volume 2146 of LNCS, Springer-Verlag, 2001.
11. P. Paillier. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In Advances in Cryptology - Eurocrypt’99, LNCS vol. 1592, Springer, 1997, pages 223-238.
12. 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-16.
13. T. Takagi Fast RSA type Cryptosystems Using n-adic Expansion. In Proc. Of Crypto’97, volume 1294 of LNCS, Springer-Verlag, 1997.