Secure Message Transmission using Lagrange Polynomial Interpolation and Huffman Coding
R. SivaRanjani, D. Lalitha Bhaskari, P. S. Avadhani · International Journal of Computer Applications · 2012
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.