16th Symposium on Computer Architecture and High Performance Computing
DOI: 10.1109/sbac-pad.2004.5
|View full text |Cite
|
Sign up to set email alerts
|

A Performance Evaluation of ARM ISA Extension for Elliptic Curve Cryptography over Binary Finite Fields

Abstract: Abstract

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
6
0

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 13 publications
(6 citation statements)
references
References 6 publications
(13 reference statements)
0
6
0
Order By: Relevance
“…We also provide a more precise evaluation of the resistance against power analysis attacks for each design, due to the integration of an objective metric that quantifies the information leaked by different protected implementation. Lastly, our quantitative analysis applies jointly to security and performance issues and drives the process of ISE identification and synthesis; to the best of our knowledge, prior ISE identification methods have been driven primarily by performance [10,4,25].…”
Section: Background and Related Workmentioning
confidence: 99%
“…We also provide a more precise evaluation of the resistance against power analysis attacks for each design, due to the integration of an objective metric that quantifies the information leaked by different protected implementation. Lastly, our quantitative analysis applies jointly to security and performance issues and drives the process of ISE identification and synthesis; to the best of our knowledge, prior ISE identification methods have been driven primarily by performance [10,4,25].…”
Section: Background and Related Workmentioning
confidence: 99%
“…Word-level polynomial multiplication was shown in [55] to be the time-critical operation when targeting an ARM processor and a special Galois Field multiplication instruction resulted in significant performance improvement. Instruction set extensions targeting a SPARC V8 processor core were used to accelerate the multiplication of binary polynomials for arithmetic in GF(2 m ) in [56], resulting in almost double the performance for the Galois Field GF (2 191 ) and a fixed reduction polynomial.…”
Section: Previous Workmentioning
confidence: 99%
“…Instruction sets proposed by [9], [10] and [11] provide for multiplication and reversing the bits of the field element. These experiments demonstrated that finite field multiplication consumes more than 90% of elliptical curve software benchmarks.…”
Section: Introductionmentioning
confidence: 99%