Text Cryptography via Special Polynomial Technique


  • Adil AL-Rammahi Faculty of CSM, Uinversity of Kufa




Text Cryptography, Polynomial and Interpolation


Discrete cryptographic such as RSA, knapsack, and discrete logarithms are the oldest and best cryptographic techniques. They are worked during finite field. In this paper, an attempt to another branch of cryptography was introduced. In this proposed method, the interpolation branch of mathematics is used for text cryptography. Proposed method was introduced to cipher the plaintext message as word by word. In encryption part, three steps are implemented for product cipher word. First, each letter of the word transformed to decimal number, then to binary. Second, the binary codeword transformed to decimal. Third, the finally cipher word is represented as triple. So it transformed to three numbers by descending the original number. A quadratic polynomial is constructed where the three numbers are represented in the coefficients of the polynomial. By choosing of three temp small independent values, three dependent values are calculated as the code word. For decryption part, the special polynomial technique is used for recover the quadratic polynomial. The rest steps are deduced conversely with the encryption part procedure


Download data is not yet available.


B.S. Kaliski, R.L.Rivest, and A.T. Shermam, is the data encryption standard a group, result of cycling experiments on DES, cryptology, vol.1,1988, pp. 3-36. DOI: https://doi.org/10.1007/BF00206323

T. ElGamal, A public key cryptosystem and a signature scheme based on discrete logarithms, IEEE Transactions on Information Theory, 469-472, 1985. DOI: https://doi.org/10.1109/TIT.1985.1057074

I. Biehl, B. Meyer, and V. M•uller. Differential fault attackson elliptic curve cryptosystems. In M. Bellare, editor, CRYPTO, volume 1880 of Lecture Notes in Computer Science, pp. 131-146. Springer, 2000. DOI: https://doi.org/10.1007/3-540-44598-6_8

M. Prabu and R. Shanmugalakshmi , A Comparative and Overview Analysis of Elliptic Curve Cryptography over FiniteFields, International Conference on Information and Multimedia Technology, ICIMT '09,2009, PP. 459-499. DOI: https://doi.org/10.1109/ICIMT.2009.66

X. Guangli; C. Zhuxiao; , The AlgebraHomomorphic Encryption Scheme Based on Fermat's Little Theorem, International Conference on Communication Systems and Network Technologies , vol.1, no.1, pp.978-981, 2012. [6]B.R. Ambedikar and S.S. Bedi, A New Factorization Method to Factorize RSA Public Key Encryption, IJCSI International Journal of Computer Science Issues, Vol. 8, Issue 6, No 1, November, 2011, pp. 242-247.

R. Rivets, A. Shamir, and L. Adleman, A Method for Obtaining Digital Signatures and Public-Key Cryptosystems, Communications of the ACM 21 (2), pages 120-126,1978. DOI: https://doi.org/10.1145/359340.359342

A. AL-Rammahi and N. Ressol, On The Public Key Cryptography, J. Babil University, Vol.7, No.3, 2002, Pp.496-472.

P. Kitsos, G. Theodoridis, and O. Koufopavlou, An efficient reconfigurable multiplier architecture for Galois Field GF(Pm), Microelectronics Journal 34, 2003, pp. 975–980. DOI: https://doi.org/10.1016/S0026-2692(03)00172-1

A. M. Odlyzko, Discrete Logarithms: The Past and the Future,Designs, Codes,and Cryptography19, 2000, Pp. 129-145. DOI: https://doi.org/10.1023/A:1008350005447

R. C. Merkle & H. Hellman, Knapsack Problem, IEEE Inf. Th. It-24,No.5, Sept., 1978, Pp. 525-530. DOI: https://doi.org/10.1109/TIT.1978.1055927

S. Mahajanand S. Easo,Performance Evolution of RSA and New Cryptosystem, International Journal of Emerging Technology and Advanced Engineering, Volume 2, Issue 3, March 2012, pp. 279-283.

P. Matkar and L. Dole,Energy Aware Blind Data Aggregation For Data Integrity in Wireless Sensor Network, International Journal of Emerging Science and Engineering,vol.1, issue9, 2013, pp. 1-4.

P. Jain, R. Jain and T. Verma, Comparison and Implementation of Cryptography Algorithm By Using VHDL, International Journal of Emerging Technology and Advanced Engineering, Volume 2, Issue 11, November 2012, pp. 120-124.

H.O. Alanazi, B.B. Zaidan, A.A.Zaidan, H.A. Jalab, M.Shabbir and Y. Al-Nabhani, New Comparative Study Between DES, 3DES and AES within NineFactors, Journal Of Computing, Volume 2, Issue 3, March 2010, pp. 152-157.

G. S. Anjaneyulu, P.V. Reddy and U.M. Reddy, Secured Digital Signature Scheme using Polynomials over Non-Commutative Division Semi rings , International Journal of Computer Scienceand Network Security, 8, 2008, pp. 278–284.

A. Taqa, A.A. Zaidan, and B.B Zaidan, New Framework for High Secure Data Hidden in the MPEG Using AES Encryption Algorithm, International Journal of Computer and Electrical Engineering, Vol. 1, No. 5 December, 2009, pp. 566-571. DOI: https://doi.org/10.7763/IJCEE.2009.V1.87

Z. P. Buba and G. M. Wajiga, Cryptographic Algorithms for Secure Data Communication,International Journal of Computer Science and Security , Volume 5, Issue 2, 2011, pp. 227-243.

R. S. Ranjani, D. L. Bhaskari, P. S. Avadhani, Secure Message Transmission using Lagrange Polynomial Interpolation and Huffman Coding, International Journal of Computer Applications, Volume 55–No.1, October 2012, pp. 32-35. DOI: https://doi.org/10.5120/8721-2593

S. Sahana, J. Sen, and C. Mondal, Secure Adaptive N-Cryption (SAN) –A Secure Algorithm for Data Transmission, International Journal of Computer Applications in Engineering Sciences, volume 3, 2013, pp. 205-213.

N. Kaur, A. Singh, S. Singh, Enhancement of Network Security Techniques using Quantum Cryptography, Navleen Kaur et al. / International Journal on Computer Science and Engineering, Vol. 3 No. 5 May 2011, pp. 1960-1964.

M. N. Khaled, and H.A. Jalab, Data security based on neural networks, TASK Quarterly 9 No 4, 2005, pp. 409–414.

R. L. Burden and J. D. Fairs, Numerical Analysis, Brooks/Cole Publishing Company,1984.

B. Kolman, Introductory Linear Algebra with Applications, Macmillan Publishing Company, New York , 3e. [25]A. Menezes, and P. V. Orschot, Handbock of Applied Cryptography, CRC Press, 1996, pp. 283-319.

E. Volna, M. Kotyrba, V. Kocian, M. Janosek, Cryptography Based On Neural Network, Proceedings 26th European Conference on Modelling and Simulation 2011. DOI: https://doi.org/10.7148/2012-0386-0391




How to Cite

Adil AL-Rammahi, A. (2022). Text Cryptography via Special Polynomial Technique. Journal of Kufa for Mathematics and Computer, 9(1), 10–14. https://doi.org/10.31642/JoKMC/2018/090103

Similar Articles

1 2 > >> 

You may also start an advanced similarity search for this article.