Referenced Items are not available for this document.
In the current work, we propose a pipelining scheme for implementing elliptic curve cryptosystems (ECC). The scalar multiplication is the dominant operation in ECC. It is computed by a series of point additions and doublings. The pipelining scheme is based on a key observation: to start the subsequent operation, one need not wait until the current one exits. The next operation can begin while a part of the current operation is still being processed. To our knowledge, this is the first attempt to compute the scalar multiplication in such a pipelined manner. Also, the proposed scheme can be made resistant to sidechannel attacks (SCA). Our scheme compares favorably with all SCA-resistant sequential and parallel methods
Published in:
Computers, IEEE Transactions on
(Volume:55
,
Issue:
8
)
Date of Publication: Aug. 2006
- Page(s):
- 1000 - 1010
- ISSN :
- 0018-9340
- INSPEC Accession Number:
- 9039818
- Digital Object Identifier :
- 10.1109/TC.2006.129
- Date of Current Version :
- 05 July 2006
- Issue Date :
- Aug. 2006
- Sponsored by :
- IEEE Computer Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
