Since many efficient algorithms for implementing pairings have been proposed such as ηTpairing and the Ate pairing, pairings could be used in constraint devices such as smart cards. However, the secure implementation of pairings has not been thoroughly investigated. In this paper, we investigate the security of ηTpairing over binary fields in the context of side-channel attacks. We propose efficient and secure ηTpairing algorithms using randomized projective coordinate systems for computing the pairing.
|Number of pages||12|
|Publication status||Published - Feb 1 2008|
All Science Journal Classification (ASJC) codes
- Electronic, Optical and Magnetic Materials
- Computer Science(all)
- Electrical and Electronic Engineering