Elliptic Curve Public Key Cryptosystems
Elliptic Curve Public Key Cryptosystems
Identity-Based Encryption from the Weil Pairing
SIAM Journal on Computing
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Efficient Algorithms for Pairing-Based Cryptosystems
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Protections against Differential Analysis for Elliptic Curve Cryptography
CHES '01 Proceedings of the Third International Workshop on Cryptographic Hardware and Embedded Systems
The Weil Pairing, and Its Efficient Calculation
Journal of Cryptology
Efficient pairing computation on supersingular Abelian varieties
Designs, Codes and Cryptography
Ate Pairing on Hyperelliptic Curves
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Implementing cryptographic pairings on smartcards
CHES'06 Proceedings of the 8th international conference on Cryptographic Hardware and Embedded Systems
CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
Side channel attacks and countermeasures on pairing based cryptosystems over binary fields
CANS'06 Proceedings of the 5th international conference on Cryptology and Network Security
| Hi-index | 0.00 |
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.