Pairing-based cryptosystems have developed very fast in the last few years. The efficiencies of these cryptosystems depend on the computation of the bilinear pairings, In this paper, a new efficient algorithm based on double-base chains for computing the Tate pairing is proposed for odd characteristic p 〉 3. The inherent sparseness of double-base number system reduces the computational cost for computing the Tate pairing evidently. The new algorithm is 9% faster than the previous fastest method for the embedding degree k = 6. 相似文献
Based on the study of RBS algorithm in wireless sensor network, an improved algorithm named RBRS is presented, to solve the time synchronization problem of multi hop networks. On the basis of RBS, the broadcast group and least square linear regression methods were used to realize entire network time synchronization in the algorithm. Synchronization error and overhead with the existing improved BRS are compared in the article. The result shows that the algorithm has certain superiority in many algorithms, which is suitable for light and low power consumption network load. Through an emulation with the matlab software, the result indicates that error accumulation is lower in the optimized algorithm, the synchronization overhead is significantly reduced and can realize the time synchronization of the whole network. A time synchronization algorithm based on RBRS algorithm is proposed for multi-hop and the low power consumption. A variable period synchronization method is introduces in the algorithm: in line with Bias maximum a posterior estimation principle, the maximum phase offset is estimated to determine the synchronization period, which can reduce the number of node synchronization, and with the least square linear regression method, the periodic fitting clock offset. The Simulation in matlab indicate that RBRS algorithm can improve the synchronization accuracy and reduce energy consumption significantly, which is conducive to extend the life of the network.
下载免费PDF全文