Analysis A parallel combination between the Number Theorists aRe Us, Riverst Shamir Adleman and Triple Data Encryption Standard methods for measuring the speed of document security. (July 2019)

• Record Type: Journal Article
• Authors: Hardiaman Hulu, Luken Candawan; William, ; Sipayung, David; Hafis, Muhammad; Christnatalis,
• Is Part Of: Journal of physics. Volume 1230(2019)
• Publication Date: 2019-07
• Subjects: Physics -- Congresses; 530.5
• DOI: 10.1088/1742-6596/1230/1/012093
• Languages: English
• ISSNs: 1742-6588

Abstract

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.