2017
DOI: 10.1007/978-3-319-54876-0_15
|View full text |Cite
|
Sign up to set email alerts
|

High-Performance Elliptic Curve Cryptography by Using the CIOS Method for Modular Multiplication

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2019
2019
2021
2021

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 20 publications
0
3
0
Order By: Relevance
“…Therefore, the operation dG is the d doubling time for G, which results in another point (x j , y j ), known as the public key. The security of ECC is based on the hardness of the mathematical problem [38], which indicates that in knowing the public key point and the base point G, it is impossible to find d in polynomial time. This is referred to in the literature as the elliptic curve discrete logarithm problem (ECDLP) [39].…”
Section: B Elliptic Curve Cryptography (Ecc)mentioning
confidence: 99%
“…Therefore, the operation dG is the d doubling time for G, which results in another point (x j , y j ), known as the public key. The security of ECC is based on the hardness of the mathematical problem [38], which indicates that in knowing the public key point and the base point G, it is impossible to find d in polynomial time. This is referred to in the literature as the elliptic curve discrete logarithm problem (ECDLP) [39].…”
Section: B Elliptic Curve Cryptography (Ecc)mentioning
confidence: 99%
“…The public key is the product of the operation dG, which is the d doubling times for the base point G. This operation results in point (x j , y j ). ECC's security stems from the computational hardness associated with finding d when the adversary has the base point G and the public key [17]. The abovementioned ECDLP stipulates that there is no efficient algorithm that yields d in polynomial time.…”
Section: Preliminary: Elliptic Curve Cryptography (Ecc)mentioning
confidence: 99%
“…If no such y exists, then x is not mapped to the elliptic curve. The crucial advantage associated with mapping points to an elliptic curve stems from an exploitation of the elliptic curve discrete logarithm problem (ECDLP) [17], which constitutes the base of ECC. However, if a message M, encrypted using ECC, did not map to an elliptic curve (i.e., the x value of M has no corresponding y), then it is necessary to increment x and recalculate until y is found [18][19][20].…”
Section: Introductionmentioning
confidence: 99%