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
Published in2008 IEEE/ACS International Conference on Computer Systems and Applications pp. 860 - 865
Main Authors Al-Somani, T.F., Amin, A.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.03.2008
Subjects
Elliptic curve cryptography
Elliptic curves
Energy consumption
Galois fields
High performance computing
Petroleum
Public key cryptography
Resists
Security
Timing
Online AccessGet full text

Cover

More Information
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.
ISBN:9781424419678
1424419670
ISSN:2161-5322
2161-5330
DOI:10.1109/AICCSA.2008.4493630