Call for Paper - January 2024 Edition
IJCA solicits original research papers for the January 2024 Edition. Last date of manuscript submission is December 20, 2023. Read More

Secure Message Transmission using Lagrange Polynomial Interpolation and Huffman Coding

International Journal of Computer Applications
© 2012 by IJCA Journal
Volume 55 - Number 1
Year of Publication: 2012
R. Siva Ranjani
D. Lalitha Bhaskari
P. S. Avadhani

Siva R Ranjani, Lalitha D Bhaskari and P S Avadhani. Article: Secure Message Transmission using Lagrange Polynomial Interpolation and Huffman Coding. International Journal of Computer Applications 55(1):32-35, October 2012. Full text available. BibTeX

	author = {R. Siva Ranjani and D. Lalitha Bhaskari and P. S. Avadhani},
	title = {Article: Secure Message Transmission using Lagrange Polynomial Interpolation and Huffman Coding},
	journal = {International Journal of Computer Applications},
	year = {2012},
	volume = {55},
	number = {1},
	pages = {32-35},
	month = {October},
	note = {Full text available}


In this paper, an algorithm for secure transmission of message is proposed based on Lagrange's interpolation. The message is viewed as a polynomial of degree n where n is kept secret and transmitted to the receiver's side using the concept of a digital envelope. As any nth degree polynomial is uniquely determined by n+1 points, n +1 points are communicated to the other side, where the polynomial and hence the message is reconstructed. Padding of length m is added to the message to overcome the message length issue. Although any coding scheme may be used, in this paper Huffman coding is used for converting the plaintext into binary form. Finally, the proposed algorithm is compared with the performance of RSA algorithm and found to be efficient.


  • Th. Sauer and Y. Xu. On multivariate Lagrange interpolation. Mathematics of computation Volume 64, pages 1147-1170, jul 1995.
  • R. L. Rivest, A. Shamir, L. Adleman "A method for obtaining digital signatures and Public-Key Cryptosystems", Communications of the ACM Volume 21,pp:120-126, 1978.
  • A. Nadeem, "A performance comparison of data encryption algorithms", IEEE information and communication technologies, pp. 84-89, 2006.
  • Hwang, R. J. , Su, F. F. , Yeh, Y. S. and Chen, C. Y. 2005. An Efficient Decryption Method for RSA Cryptosystem. AINA'05 Pp:585- 590, 2005.
  • Davis, T. RSA Encryption [Online]. Available from World Wide Web: http://www. geometer. org /mathcircles, March 2006.
  • D. A. Huffman, "A Method for the Construction of Minimum-Redundancy Codes", Proceedings of the I. R. E. , pp 1098–1102, September 1952.
  • Press, WH; Teukolsky, SA; Vetterling, WT; Flannery, BP "Chapter 7. Random Numbers". Numerical Recipes: The Art of Scientific Computing (3rd ed. ). New York: Cambridge University Press. ISBN 978-0-521-88068-8, 2007.
  • R. Lidl and H. Niederreiter, Finite fields, 2nd edition, Cambridge University Press, Cambridge, 1997.
  • Chia-Long Wu*, Der-Chyuan Lou, and Te-Jen Chang , "Computational Complexity Analyses of Modular Arithmetic for RSA Cryptosystem",23rd Workshop on Combinatorial Mathematics and Computation Theory (CMCT'06) , Taichung, Taiwan, pp. 215-224, April 28-29, 2006.
  • Saurabh Singh, Gaurav Agarwal, "Use of Chinese Remainder Theorem to generate random numbers for cryptography",IJAER, pp. 168-174 Nov 2010.
  • Eugéne C. Ezin,"Modeling Data transmission through a Channel Based on Huffman coding and Encryption methods", IJCSIS, Vol 8, pp:195-199, No. 9 December 2010.
  • Publicly Verifiable Secret Sharing Schemes Using Bilinear Pairings, International Journal of Network Security, Vol. 14, No. 3, PP. 142:148, May 2012.