Distinguishing Multiplications from Squaring Operations

Authors:
Frederic Amiel;Benoit Feix;Michael Tunstall;Claire Whelan;William P. Marnane
Affiliations:
AMESYS, Cedex 3, France;Inside Contactless, Cedex 3, France;Department of Computer Science, University of Bristol, Merchant Venturers Building, Bristol, United Kingdom BS8 1UB;TDS (Time Data Security) Ltd., Dublin, Ireland 24;Department of Electrical and Electronic Engineering, University College Cork, Cork, Ireland
Venue:
Selected Areas in Cryptography
Year:
2009

Citing 0
Cited 6

Exponent Recoding and Regular Exponentiation Algorithms

AFRICACRYPT '09 Proceedings of the 2nd International Conference on Cryptology in Africa: Progress in Cryptology
Random Order m-ary Exponentiation

ACISP '09 Proceedings of the 14th Australasian Conference on Information Security and Privacy
Redundant modular reduction algorithms

CARDIS'11 Proceedings of the 10th IFIP WG 8.8/11.2 international conference on Smart Card Research and Advanced Applications
Square always exponentiation

INDOCRYPT'11 Proceedings of the 12th international conference on Cryptology in India
Complete atomic blocks for elliptic curves in jacobian coordinates over prime fields

LATINCRYPT'12 Proceedings of the 2nd international conference on Cryptology and Information Security in Latin America
Defeating with fault injection a combined attack resistant exponentiation

COSADE'13 Proceedings of the 4th international conference on Constructive Side-Channel Analysis and Secure Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

In recent years there has been much interest in the development and the fast computation of bilinear pairings due to their practical and myriad applications in cryptography. Well known efficient examples are the Weil and Tate pairings and their variants ...