Securing pairing-based cryptography on smartcards
by Mustapha Hedabou
International Journal of Information and Computer Security (IJICS), Vol. 5, No. 1, 2012

Abstract: Research efforts have produced many algorithms for fast pairing computation and several efficient hardware implementations. However, side channel attacks (SCAs) are a serious threat on hardware implementations. Previous works in this area have provided some costly countermeasures against side channel attacks. In this paper, we propose a new countermeasure based on the isomorphism classes in order to secure pairing computation on elliptic curves defined over K with Char(K)≠2, 3. The proposed technique requires only eight additional field multiplications which is negligible compared to the cost of the other known countermeasures.

Online publication date: Sat, 30-Aug-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Information and Computer Security (IJICS):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com