Title :
Some New Optimal Pairings
Author :
Shang, He ; Wang, Mingqiang
Author_Institution :
Sch. of Math., Shandong Univ., Jinan, China
Abstract :
The Ate pairing can be computed efficiently on ordinary elliptic curves with small value of the trace of Frobenius t. The Ate pairing generalizes the Ate pairing, and can possibly shorten the Miller loop to be as small as r 1/φ(k) on some special pairing-friendly curves with large value of Frobenius t. However, not all pairing-friendly curves have this property. In this paper, we generalize the Atei pairing further. By our method, we can shorten the the Miller loop to be nearly r 1/φ(k) on some pairing-friendly curves, while the Ate pairing can not reach.
Keywords :
algebra; public key cryptography; Ate pairing; Frobenius; Miller loop; optimal pairings; ordinary elliptic curves; Ate pairing; Optimal pairing; Pairing lattice; Pairing-friendly elliptic curves;
Conference_Titel :
Computational Intelligence and Security (CIS), 2010 International Conference on
Conference_Location :
Nanning
Print_ISBN :
978-1-4244-9114-8
Electronic_ISBN :
978-0-7695-4297-3
DOI :
10.1109/CIS.2010.90