Open AccessImplementation Of Eliptic Curve Cryptography Using The Elgamald Algorithm And Primary Number Generating Method Rabin-Miller For Text File Security
Author(s) -
Eko Putra
Publication year - 2022
Publication title -
journal basic science and technology
Language(s) - English
Resource type - Journals
eISSN - 2808-1498
pISSN - 2089-8185
DOI - 10.35335/jbst.v11i1.1773
Subject(s) - elliptic curve cryptography , elgamal encryption , encryption , elliptic curve digital signature algorithm , computer science , key size , elliptic curve , cryptography , algorithm , public key cryptography , hyperelliptic curve cryptography , prime (order theory) , mathematics , theoretical computer science , discrete mathematics , computer security , combinatorics , pure mathematics
The biggest weakness of Elliptic Curve Cryptography is the difficulty of points counting in elliptic curve which affects the process time. This paper considers a method of simplifying the counting in Elliptic Curve Cryptography and quickening the process time without decreasing the security level. Using ElGamal Algorithm as method of encryption, the implementation also involves Rabin-Miller Prime Number Generator to generate the public key. The system is tested using five different text files with different sizes and lengths. The result shows that by limiting the value of a and b to 1 in the elliptic curve function and also limiting the prime number down to two digits, successfully quicken the process time, the encryption process also takes only a small amount of time.