2018
DOI: 10.12928/telkomnika.v16i1.6953
|View full text |Cite
|
Sign up to set email alerts
|

Efficiency of 128-bit Encryption and Decryption Process in Elgamal Method Using Elliptic Curve Cryptography (ECC)

Abstract: Cryptography is a growing science of data security. The integrity of a data is an important thing to keep the secrets contained in the data. In this research will be visualized the efficient quantities that use elliptic curves and do not use them. The Elgamal method is an asymmetric cryptographic algorithm whose complexity of processes. It is especially for digital signatures. This research will discuss about the use of ECC to optimize and streamline the Encryption and Decryption process in particular 128-bit … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 22 publications
0
3
0
Order By: Relevance
“…with InvMixColumns and still produce the same transformation. The following is the AES algorithm decryption process using the operating mode [8], [14], [30], [31].…”
Section: Decryption Processmentioning
confidence: 99%
“…with InvMixColumns and still produce the same transformation. The following is the AES algorithm decryption process using the operating mode [8], [14], [30], [31].…”
Section: Decryption Processmentioning
confidence: 99%
“…In addition to this publicly declared point, G and the elliptic curve details Ep (a, b) must also be made public. In cases where no public information is defined, the plain text message sender shall pick a positive integer k randomly, such as k < p. The public key PB is then used to produce the cipher text Cm consisting of two points, {k G} and {Pm+ (k PB)} [15]. The sender then sends the pair of cipher points C1 and C2 (both with the same Cm) to the recipient.…”
Section: A Elliptic Curve Discrete Logarithm Problem (Ecdlp)mentioning
confidence: 99%
“…The sender then sends the pair of cipher points C1 and C2 (both with the same Cm) to the recipient. The receiver multiplies the pair's first point by his own private key when he receives the cipher point pair Cm and subtracts the result from the second point, as shown below [15].…”
Section: A Elliptic Curve Discrete Logarithm Problem (Ecdlp)mentioning
confidence: 99%