Class of Provably Secure Information Authentication Systems
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.
KeywordsInformation authentication provably secure cryptosystems digital signature public encryption public key cryptosystem
Unable to display preview. Download preview PDF.
- 2.Menezes, A.J., Vanstone, S.A.: Handbook of Applied Cryptography, p. 780. CRC Press (1996)Google Scholar
- 3.Pieprzyk, J., HardjonoTh., S.J.: Fundumentals of Computer Security, p. 677. Springer, Berlin (2003)Google Scholar
- 4.Rabin, M.O.: Digitalized signatures and public key functions as intractable as factorization. —Technical report MIT/LCS/TR-212, MIT Laboratory for Computer Science (1979)Google Scholar
- 5.Fiat, A., Shamir, A.: How to prove yourself: Practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186–194. Springer, Heidelberg (1987)Google Scholar