Encryption and Decryption without any Cryptographic Algorithm
Keywords:
Multivariate Polynomial, Magic Rectangle, Vandermonde Matrix, 1-1 function, Inverse function and KeyAbstract
In both symmetric and asymmetric cryptosystems key plays a vital role in performing both encryption and decryption. Symmetric-key encryption is very fast but key management is a major issue. Asymmetric or public-key encryption is slow in nature but key management is not a major issue because one key is derived from another. In both encryption algorithms the security of cryptographic algorithms depends on the size of the key. Normally, the key is shared in symmetric-key algorithm or derived in public-key algorithm, then encryption is performed using any one of the cryptographic algorithms. But, in this paper, a novel method is used in generating the key in terms of 1-1 function for encryption and the inverse of 1-1 function is used for decryption. For generating the key a multivariate polynomial, magic rectangle and Vandermonde Matrix are used. Based on 1-1 and inverse of 1-1 function encryption and decryptions are performed respectively without using any existing cryptographic algorithm
References
- Introduction to Cryptography: Principles and Applications, Book by Hans Delfs and Helmut Knebl, Springer, third edition, 2002.
- A.J. Menezes, P.C. Van Oorschot, and S. Vanstone, "Handbook of Applied Cryptography", CRC Press, Boca Ration, Florida, USA, 1997.
- Multivariate Cryptography precision.moscito.org / by-publication /recent/00421-multivariate.pdf.
- Lih-Chung Wang, Bo-Yin Yang, Yu-Hua Hu, and Feipei Lai "A Medium-Field Multivariate Public-Key Encryption Scheme", 2015.
- Ding, J., Hu, L. High order linearization equation (hole) attack on multivariate public key cryptosystems, Lecture Notes in Computer Science, 4450: 233–248, 2007.
- Xin Wang , Feng Feng, Xinmei Wang, Qi Wang, "A More Secure MFE Multivariate Public Key Encryption Scheme", International Journal of Computer Science and Applications Technomathematics Research Foundation Vol. 6, No. 3, pp. 1-9 , 2009.
- Yun-Ju Huang, Feng-Hao Liu, Bo-Yin Yang, "Public-Key Cryptography from New Multivariate Quadratic Assumptions", May 15, 2012.
- Farshid Delgosha, Erman Ayday, Faramarz Fekri , MKPS: A Multivariate Polynomial Scheme for Symmetric Key-Establishment in Distributed Sensor Networks.
- Rajesh P. Singh, B. K. Sarma, A. Saikia, "Public key cryptography using Permutation P-Polynomials over Finite Fields".
- Jean-Paul Tremblay, R. Manohar "Discrete Mathematical Structures with Applications to Computer Science", February 2nd 2001 , McGraw Hill Education.
- Douglas Wilhelm Harder The Vandermonde Method, University of Waterloo, Onrario,Canada N2L 3GI, https://ece.uwaterloo.ca/~dwharder/NumericalAnalysis/05 Interpolation/Vandermonde.
- Wikipedia Vandermonde Matrix, https://en.wikipedia.org/wikiVander monde_matrix.
- Ruma Kareem Ajeena, Hailiza Kamarulhaili and Sattar B. Almaliky, "Bivariate Polynomials Public Key Encryption Schemes" , International Journal of Cryptology Research 4(1): 73 – 83, 2013.
- Mani. K, Viswambari. M, "Enhancing the Security in Cryptosystems Based on Magic Rectangle", International Journal of Computer Network and Information Security (IJCNIS), Vol. 9, No.4, 2017.
Downloads
Published
Issue
Section
License
Copyright (c) IJSRCSEIT
This work is licensed under a Creative Commons Attribution 4.0 International License.