2018
DOI: 10.1504/ijcse.2018.095845
|View full text |Cite
|
Sign up to set email alerts
|

Fast elliptic curve scalar multiplication for resisting against SPA

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2019
2019
2020
2020

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 0 publications
0
1
0
Order By: Relevance
“…For instance, refs. [57,58] introduced efficient algorithms to increase scalar multiplication performance on the elliptic curve. Equally important, other proposed schemes have described how the ECC phases can be performed, but they neglect to use (or to elaborate on) the approach to padding bits used to secure the mapping phase [59,60].…”
Section: Related Workmentioning
confidence: 99%
“…For instance, refs. [57,58] introduced efficient algorithms to increase scalar multiplication performance on the elliptic curve. Equally important, other proposed schemes have described how the ECC phases can be performed, but they neglect to use (or to elaborate on) the approach to padding bits used to secure the mapping phase [59,60].…”
Section: Related Workmentioning
confidence: 99%