Security

Secure Message Transmission Using Lagrange Polynomial Interpolation and Huffman Coding

Download Now Free registration required

Executive Summary

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.

  • Format: PDF
  • Size: 676.74 KB