2019
DOI: 10.1007/978-3-030-21548-4_36
|View full text |Cite
|
Sign up to set email alerts
|

Secure and Compact Elliptic Curve Cryptosystems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
12
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
2
2

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(12 citation statements)
references
References 13 publications
0
12
0
Order By: Relevance
“…In [32], researchers presented secure ECC suitable for compact devices by using a modified addition formula for usual RLA. Although proposed method needs less space complexity, the time delay of the encryption process was increased because of using affine coordinates.…”
Section: Background and Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…In [32], researchers presented secure ECC suitable for compact devices by using a modified addition formula for usual RLA. Although proposed method needs less space complexity, the time delay of the encryption process was increased because of using affine coordinates.…”
Section: Background and Related Workmentioning
confidence: 99%
“…However, the proposed algorithm did not utilize inherited parallelism in the different levels of computations in the encryption process, which is essential to develop high speed crypto processor. Moreover, ECCs presented in [32][33] are vulnerable to side channel attacks.…”
Section: Background and Related Workmentioning
confidence: 99%
“…Similarly, O + P and P + P are exceptional computations of Jacobian and projective addition formula. To reduce exceptional computations from affine coordinates, extended affine coordinates assign (0, 0) as the point at infinity for elliptic curves without point (0, 0), such as prime order elliptic curves [8]. Using the extended affine addition formulae, P + Q = O and 2P = O can be computed as (0, 0), which is exactly the point at infinity.…”
Section: Addition Formulae and Exceptional Computationsmentioning
confidence: 99%
“…Elliptic curve CA formulae [7,15,17] can achieve secure ECSM algorithms but are inefficient in terms of memory and computational costs. Another secure ECSM, which uses (extended) affine, is more efficient for both memory and computational costs [8]. However, it scans input scalars from right to left (RL).…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation