Open AccessAnalysis of File Security with Three-Pass Protocol Scheme Using Massey-Omura Algorithm In Android
Author(s) -
Dian Rachmawati,
Mohammad Andri Budiman,
Muhammad Adib Rikzan
Publication year - 2019
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1235/1/012075
Subject(s) - computer science , key exchange , cryptography , algorithm , theoretical computer science , key size , graph , public key cryptography , computer network , encryption
Today’s data transactions using the android device is commonly done anytime. Cryptography is needed to secure data to be transmitted to ensure data security from the manipulation of others. To secure the data, one of cryptography scheme is Three-Pass Protocol, this scheme allows data transmission without key exchange, so this scheme is more secure and efficient. A Massey-Omura algorithm is an asymmetric key cryptography system that will be used in this research. For primality testing in key and prime number generator, the Agrawal-Biswas algorithm will be used. The strength of Massey-Omura is the difficulty of calculating enormous discrete logarithmic and Three-Pass Protocol with his no key exchange capabilities make this method more secure. In this research, the Mean Squared Error value obtained is 0 and the value of Peak Signal to Noise Ratio obtained is infinite. The complexity of the Massey-Omura algorithm and the Agrawal-Biswas algorithm is Θ (n). Graph of file extension against processing time shows a stable graph that means file extension is not affecting processing time. Graph of file size against processing time shows a linear graph that means a processing time would increase along with file size.