Sciweavers

CHES
2006
Springer

Implementing Cryptographic Pairings on Smartcards

13 years 8 months ago
Implementing Cryptographic Pairings on Smartcards
Abstract. Pairings on elliptic curves are fast coming of age as cryptographic primitives for deployment in new security applications, particularly in the context of implementations of Identity-Based Encryption (IBE). In this paper we describe the implementation of various pairings on a contemporary 32-bit smart-card, the Philips HiPerSmartTM , an instantiation of the MIPS-32 based SmartMIPSTM architecture. Three types of pairing are considered, first the standard Tate pairing on a nonsupersingular curve E(Fp), second the Ate pairing, also on a nonsupersingular curve E(Fp), and finally the T pairing on a supersingular curve E(F2m ). We demonstrate that pairings can be calculated as efficiently as classic cryptographic primitives on this architecture, with a calculation time of as little as 0.15 seconds.
Michael Scott, Neil Costigan, Wesam Abdulwahab
Added 20 Aug 2010
Updated 20 Aug 2010
Type Conference
Year 2006
Where CHES
Authors Michael Scott, Neil Costigan, Wesam Abdulwahab
Comments (0)