Partitioned Computation to Accelerate Scalar Multiplication for Elliptic Curve Cryptosystems

Author

Wu, Keke ; Li, Dawei ; Li, Huiyun ; Chen, Tingding ; Yu, Fengqi

Author_Institution

Inst. of Comput. Technol., CAS, Beijing, China

fYear

2009

fDate

8-11 Dec. 2009

Firstpage

551

Lastpage

555

Abstract

The scalar multiplication is the dominant operation in Elliptic Curve Cryptosystems (ECC). It consists of a series of point additions and point doublings. A number of algorithms have been proposed to accelerate the scalar multiplication. Most of the algorithms demand high complexity which makes scalar multiplication hard to implement. In this paper, we propose an efficient algorithm for computing scalar multiplication based on partitioning scalar and propositional logic theory to address the trade-offs between speed and complexity. Our algorithm remains low complexity compared to existing accelerated scalar multiplication algorithms, whilst it is suitable for parallel processing systems.

Keywords

algorithm theory; formal logic; linear algebra; matrix multiplication; public key cryptography; accelerated scalar multiplication algorithm; elliptic curve cryptosystem; partitioned computation; prepositional logic theory; propositional logic theory; Acceleration; Content addressable storage; Elliptic curve cryptography; Elliptic curves; Galois fields; Logic; Parallel architectures; Partitioning algorithms; Personal digital assistants; Security; Elliptic curve cryptosystems; classic binary algorithm; elliptic curve; propositional logic; scalar multiplication;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel and Distributed Systems (ICPADS), 2009 15th International Conference on

Conference_Location

Shenzhen

ISSN

1521-9097

Print_ISBN

978-1-4244-5788-5

Type

conf

DOI

10.1109/ICPADS.2009.9

Filename

5395341