The Hardness of Hensel Lifting: The Case of RSA and Discrete Logarithm
From MaRDI portal
Publication:4412805
DOI10.1007/3-540-36178-2_19zbMath1066.94010MaRDI QIDQ4412805
Dario Catalano, Jacques Stern, Phong Q. Nguyen
Publication date: 16 July 2003
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-36178-2_19
lattice; RSA; discrete logarithm; Paillier cryptosystem; public-key; one-wayness; Hensel lift; probabilistic cryptosystem
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
94A60: Cryptography
11Y16: Number-theoretic algorithms; complexity
Related Items
The Geometry of Provable Security: Some Proofs of Security in Which Lattices Make a Surprise Appearance, On-line/off-line DCR-based homomorphic encryption and applications, An efficient probabilistic public-key cryptosystem over quadratic fields quotients, Encoding-Free ElGamal-Type Encryption Schemes on Elliptic Curves, Two Generic Constructions of Probabilistic Cryptosystems and Their Applications