An efficient high performance scalar multiplication method with resistance against timing attacks

This paper presents an efficient high performance elliptic curve scalar multiplication method with resistance against Timing Attacks. The main idea of the proposed method is to control the main scalar multiplication loop such that- either- a- single-point- addition' is- performed- or- a- number...

Full description

Saved in:
Bibliographic Details
Main Authors: Al-Somani, T.F., Amin, A.
Format: Conference Proceeding
Language:English
Subjects:
Elliptic curve cryptography
Elliptic curves
Energy consumption
Galois fields
High performance computing
Petroleum
Public key cryptography
Resists
Security
Timing
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper presents an efficient high performance elliptic curve scalar multiplication method with resistance against Timing Attacks. The main idea of the proposed method is to control the main scalar multiplication loop such that- either- a- single-point- addition' is- performed- or- a- number- of- consecutive point doublings that take the same time taken by a single point addition is- performed. The proposed method works with both binary-encoded as well as NAF-encodedprivate keys with NAF encoding yielding higher performance. It requires no extra fake computations and its time complexity is less than other recently reported countermeasures, especially when parallel multipliers are used.
ISSN:2161-5322
2161-5330
DOI:10.1109/AICCSA.2008.4493630