A new public key cryptosystem based on higher residues

David Naccache, Jacques Stern
1998 Proceedings of the 5th ACM conference on Computer and communications security - CCS '98  
This paper describes a new public-key cryptosystem based on the hardness of computing higher residues modulo a composite RSA integer. We introduce two versions of our scheme, one deterministic and the other probabilistic. The deterministic version is practically oriented: encryption amounts to a single exponentiation w.r.t. a modulus with at least 768 bits and a 160-bit exponent. Decryption can be suitably optimized so as to become less demanding than a couple RSA decryptions. Although slower
more » ... an RSA, the new scheme is still reasonably competitive and has several specific applications. The probabilistic version exhibits an homomorphic encryption scheme whose expansion rate is much better than previously proposed such systems. Furthermore, it has semantic security, relative to the hardness of computing higher residues for suitable moduli.
doi:10.1145/288090.288106 dblp:conf/ccs/NaccacheS98 fatcat:czqcxtkprzazxe2rfsrcjyecaq