论文部分内容阅读
Efficient computation of Tate pairing is a crucial factor for practical applications of pairing-based cryptosystems(PBC).Recently,there have been many improvements for the computation of Tate pairing,which focuses on the arithmetical operations above the finite field.In this paper,we analyze the structure of Miller’s algorithm firstly,which is used to implement Tate pairing.Based on the characteristics that Miller’s algorithm will be improved tremendous if the order of the subgroup of elliptic curve group is low hamming prime,a new method for generating parameters for PBC is put forward,which enable it feasible that there is certain some subgroup of low hamming prime order in the elliptic curve group generated.Finally,we analyze the computation efficiency of Tate pairing using the new parameters for PBC and give the test result.It is clear that the computation of Tate pairing above the elliptic curve group generating by our method can be improved tremendously.
Efficient computation of Tate pairing is a crucial factor for practical applications of pairing-based cryptosystems (PBC). Recently, there have been many improvements for the computation of Tate pairing, which focuses on the arithmetical operations above the finite field. In this paper, we analyze the structure of Miller’s algorithm first, which is used to implement Tate pairing. Based on the characteristics that Miller’s algorithm will be improved tremendous if the order of the subgroup of elliptic curve group is low hamming prime, a new method for generating parameters for PBC is put forward, which enable it feasible that there is certain certain subgroup of low hamming prime order in the elliptic curve group generated. Finally, we analyze the computation efficiency of Tate pairing using the new parameters for PBC and give the test result. It is clear that the computation of Tate pairing above the elliptic curve group generating by our method can be improved tremendously.