Proceedings IEEE International Conference on Application-Specific Systems, Architectures, and Processors. ASAP 2003
DOI: 10.1109/asap.2003.1212868
|View full text |Cite
|
Sign up to set email alerts
|

Instruction set extension for fast elliptic curve cryptography over binary finite fields GF(2/sup m/)

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
18
0

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 31 publications
(18 citation statements)
references
References 23 publications
0
18
0
Order By: Relevance
“…Research with respect to this has been undertaken in the context of F p [Gro02] and F 2 m [GK03] instruction-set extensions for general-purpose processors. Großschädl et al propose a Multiply ACumulate (MAC) architecture for a word-level instruction-set extension.…”
Section: Word Level Operations In F 2 163mentioning
confidence: 99%
“…Research with respect to this has been undertaken in the context of F p [Gro02] and F 2 m [GK03] instruction-set extensions for general-purpose processors. Großschädl et al propose a Multiply ACumulate (MAC) architecture for a word-level instruction-set extension.…”
Section: Word Level Operations In F 2 163mentioning
confidence: 99%
“…The range of possible ECC implementations is large: starting from pure software implementations, instruction-set extensions (ISE) became popular for 16-bit and 32-bit platforms to accelerate ECC over GF(2 m ) [3]. ISE are not useful for 8-bit platforms because slow data transport in 8-bit systems will deteriorate accelerated field operations.…”
Section: Related Workmentioning
confidence: 99%
“…Finally, the boundary between hardware and software can also be defined at the level of custom instructions that are specifically designed to accelerate the field arithmetic, most notably the field multiplication [11]. Hardware/software co-design at the granularity of instruction set extensions provides the highest flexibility and requires the least amount of extra hardware of all approaches discussed in this section.…”
Section: Hardware/software Boundaries and Trade-offsmentioning
confidence: 99%
“…An alternative approach is to implement the field arithmetic in hardware and the curve/point arithmetic in software [1,2,7,14]. Furthermore, hardware acceleration at the granularity of instruction set extensions for the finite field multiplication has also been investigated [6,11,17]. Besides the hardware/software boundary, the interface between hardware accelerator and host processor is essential for the system performance, especially for "lowcost" accelerators without local storage since they require a high number of data transfers.…”
Section: Introductionmentioning
confidence: 99%