Abstract
This paper attempts to improve the classical encryption algorithm by using Lagrange interpolation method. A large positive integer is used to represent plaintext, that is, we can use plaintext as a positive integer to carry out Lagrange calculation. Because ciphertext is a big positive integer, not repeatable, it is impossible to analyze ciphertext by probability. The algorithm increases the key space and the difficulty of brute force cracking. This algorithm has the security of one-time pad. The length of the key can be less than the length of the plaintext, and the choice of the key is more flexible.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
