The Hardness of Hensel Lifting: The Case of RSA and Discrete Logarithm

DOI10.1007/3-540-36178-2_19zbMath1066.94010OpenAlexW1574176200MaRDI 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

zbMATH Keywords

latticeRSAdiscrete logarithmPaillier cryptosystempublic-keyone-waynessHensel liftprobabilistic cryptosystem

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Related Items (5)

An efficient probabilistic public-key cryptosystem over quadratic fields quotients ⋮ On-line/off-line DCR-based homomorphic encryption and applications ⋮ Encoding-Free ElGamal-Type Encryption Schemes on Elliptic Curves ⋮ Two Generic Constructions of Probabilistic Cryptosystems and Their Applications ⋮ The Geometry of Provable Security: Some Proofs of Security in Which Lattices Make a Surprise Appearance

This page was built for publication: The Hardness of Hensel Lifting: The Case of RSA and Discrete Logarithm