An efficient mixed mode paired cipher Text cryptographic algorithm based on Three hard mathematical problems

Abstract

Cryptographic Algorithms are categorized into Symmetric key algorithm and newlineAsymmetric key algorithm This categorization is based on the number of keys or newlinekey sets used for the encryption and decryption In symmetric key algorithm same newlinesingle key or key set is used for both encryption and decryption where in newlineasymmetric key algorithm different keys or key sets are used Public key is used newlinefor encryption and private key is used for decryption Widely used asymmetric key newlineor public key systems like RSA Rabin System ElGamal System Elliptical curve newlinesystem etc are based on single hard mathematical problem RSA and Rabin systems newlineare based on factoring problem Elgamal System and Elliptical curve systems are newlinebased on discrete logarithm and elliptic curve discrete logarithm problem newlinerespectively Even if these algorithms are very secure now in future the situation newlinemay change and someone may solve the single hard problem easily newlineMuch faster methods for integer factorization already exist in theory but in newlineorder to run that more power full computers have to be built If one could build newlinesuch powerful computer factorization problem could be solved easily In that case newlinenew algorithms based on multiple hard mathematical problems will get more newlinesignificance newlineIn this work a new Mixed Mode Paired cipher text Cryptographic System newline MMPCS is developed newline newline