The Weil and Tate pairings have found several new applications in cryptography.In most of these applications,the Weil pairing or Tate pairing of supersingular elliptic curves are essential tools.Therefore efficient co...The Weil and Tate pairings have found several new applications in cryptography.In most of these applications,the Weil pairing or Tate pairing of supersingular elliptic curves are essential tools.Therefore efficient computation of the Weil or Tate pairings are crucial factors for practical applications of the cryptographic protocols based pairings.The Weil pairing is thought one of two applications of the Tate pairing.Thus to compute the Weil pairing is more slow than the Tate pairing.To efficiently implement these cryptosystems it is necessary to optimize the computation time for the Tate pairing.This paper presents a new algorithm for computing Tate pairing,which is faster than Miller's algorithm that is the best-known general method.Finally,the computation cost of the new algorithm is compared with Miller's algorithm.展开更多
文摘The Weil and Tate pairings have found several new applications in cryptography.In most of these applications,the Weil pairing or Tate pairing of supersingular elliptic curves are essential tools.Therefore efficient computation of the Weil or Tate pairings are crucial factors for practical applications of the cryptographic protocols based pairings.The Weil pairing is thought one of two applications of the Tate pairing.Thus to compute the Weil pairing is more slow than the Tate pairing.To efficiently implement these cryptosystems it is necessary to optimize the computation time for the Tate pairing.This paper presents a new algorithm for computing Tate pairing,which is faster than Miller's algorithm that is the best-known general method.Finally,the computation cost of the new algorithm is compared with Miller's algorithm.
