Class of Provably secure information authentication systems

Abstract

Electronic messages authentication issue is of significant importance for computer systems. A number of public key cryptosystems based on the composite modulus (n=pq, where p and q are large primes) has been proposed to provide information authentication and only for one of them (that has been proposed by M. Rabin) security has been proved formally. In this paper we generalize the M. Rabin's public key encryption and digital signature schemes and present formal proof of the security of the class of public key cryptosystems based on difficulty of the factorization problem. © Springer-Verlag Berlin Heidelberg 2007.