Randomized Encryption and Signature Schemes PDF

Keywords

encryption, ciphertexts, public key

Abstract

An encryption scheme is randomized if many ciphertexts correspond to a given plaintext. In this paper we propose a simple and effective randomized public key encryption scheme. The scheme is based on the problem of finding a square root modulo n, where n is a product of two large distinct primes. The proposed scheme does not reveal any partial information and breaking it is as hard as factoring n. A randomized public key signature scheme is also proposed.