An efficient mixed mode and paired cipher text cryptographic algorithm for effective key distribution

作者：Rasmi P S^*; Paul Varghese

来源：International Journal of Communication Systems, 2014, 27(11): 2593-2603.

DOI：10.1002/dac.2491

• mixed mode cryptography
• discrete logarithm
• hidden root problem
• factoring problem
• hard mathematical problems

Widely used asymmetric key or public key systems such as RSA, Rabin system, ElGamal system, and elliptical curve system are based on a single hard mathematical problem such as factoring or discrete logarithm. Even if these algorithms are very secure now, in the future, the situation may change and someone can solve the single hard problem easily. In this work, a new mixed mode cryptographic algorithm based on RSA is designed, which incorporates three hard mathematical problems (hidden root problem, discrete logarithms, and factoring) to make the algorithm too secure and uses the properties of both symmetric and asymmetric key algorithms. The decryption of the cipher text by the cryptanalysts is very difficult without the knowledge of secret keys, because he or she needs to solve three hard mathematical problems, which is in fact impractical.

• 出版日期2014-11