Abstract

Computer security is a very important thing in an information system. The strength of the NTRU algorithm is the difficulty of finding a short vector of a lattice (a discrete subgroup of a collection of vectors that includes the entire vector environment) of a random polynomial that has a large degree. The strength of the RSA algorithm lies in the level of difficulty in factoring non-prime numbers into the primary factor. As long as no efficient algorithm has been found to find the prime factors of large integers, the RSA algorithm is highly recommended for message encryption. And finally this is the TRIPEL DES algorithm designed using a 56-bit key, and that size is enough to run a secure encryption technique. This algorithm provides a simple solution that is running the DES Algorithm 3 times for data blocks. The results of our study of measuring speed on encryption and decryption using the same file are superior to the RSA algorithm compared to the NTRU and TRIPLE DES algorithms.

Full Text
Paper version not known

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 call

Disclaimer: 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.