Identification of Fake Messages Using Two PKCs

Abstract In this paper, two public key cryptosystems are presented and analyzed. The first cryptosystem is an improvement of the RSA public key cryptosystem. The second cryptosystem is a novel public key cryptosystem. The encryption/decryption moduli of the second scheme are quite different from widely used encryption/decryption moduli by other public key cryptosystems. This cryptosystem is based on the exponentiation congruence and use an interesting, computer-friendly modulus: 2^n. These primitives can be used in protocols for authentication, key exchanges, and digital signatures. These two public key cryptosystems are more suitable for highly confidential digital transactions. Both of the cryptosystems are strongly IND secure. The most important thing is, that the both of the public key cryptosystems can identify whether a message is fake. The second public key cryptosystem is more secure for quantum attacks than the RSA. It is also very collaborative with hash functions such as Whirlpool and SHA-512, because of the modulus 2^n.