Results 151 to 160 of about 1,830 (178)

Improved Algorithm for Tate Pairing Computation

2008 International Symposium on Electronic Commerce and Security, 2008
In this paper, an efficient algorithm for the computation of Tate pairing on general curves is presented. Our approach is to change the binary representation of the involved integer to its non-adjacent form at first, and then pre-organize this form to make further improvement on its efficiency.
Ting Wu 0001, Min Zhang, Xiaoliang Xu, Rongbo Wang   +3 more
openaire   +1 more source

On the Final Exponentiation in Tate Pairing Computations

IEEE Transactions on Information Theory, 2013
The Tate pairing computation consists of two parts: Miller step and final exponentiation step. In this paper, we investigate the structure of the final exponentiation step. Consider an order r subgroup of an elliptic curve defined over Fq with embedding degree k. The final exponentiation in the Tate pairing is an exponentiation of an element in Fqk by (
Taechan Kim 0001, Sungwook Kim 0001, Jung Hee Cheon   +2 more
openaire   +1 more source

Fast Parallel Computation of Tate Pairing

2011 Third International Conference on Intelligent Networking and Collaborative Systems, 2011
In pairing-based cryptography, Miller's algorithm plays a key role in the calculation of pairing. Currently, most of the optimizations of Miller's algorithm are of serial structure. In this paper, we propose a parallel method for efficiently computing pairing.
Zhitu Su, Chunhui Sun, Hui Li 0006, Jianfeng Ma 0001, Kai Fan 0001   +4 more
openaire   +1 more source

Parallelizing the Weil and Tate Pairings

2011
In the past year, the speed record for pairing implementations on desktop-class machines has been broken several times. The speed records for asymmetric pairings were set on a single processor. In this paper, we describe our parallel implementation of the optimal ate pairing over Barreto-Naehrig (BN) curves that is about 1.23 times faster using two ...
Diego F. Aranha, Edward Knapp, Alfred Menezes, Francisco Rodríguez-Henríquez   +3 more
openaire   +1 more source

FPGA acceleration of the tate pairing in characteristic 2

2006 IEEE International Conference on Field Programmable Technology, 2006
This paper presents a dedicated hardware implementation of the cryptographic Tate pairing on an elliptic curve of characteristic 2 using theetaT method. Efficient techniques for pairing computation are discussed and optimised hardware architectures are presented.
Robert Ronan, Colm O'hEigeartaigh, Colin C. Murphy, Michael Scott, Tim Kerins   +4 more
openaire   +1 more source

Efficient architecture for the Tate pairing in characteristic three

APCCAS 2008 - 2008 IEEE Asia Pacific Conference on Circuits and Systems, 2008
Identity based cryptography (IBC) offers many security advantages over the conventional public key alternative. In the IBC, the bilinear pairing on elliptic curve accounts for the core operation. Such pairing operations are very complicated and slow for software realizations. Therefore, the dedicated hardware implementations and efficient architectures
Qingwei Li, Zhongfeng Wang 0001, Xinmiao Zhang 0001, Xingcheng Liu   +3 more
openaire   +1 more source

Computing the Tate Pairing

2005
We describe, in detail sufficient for easy implementation, a fast method for calculation of the Tate pairing, as required for pairing-based cryptographic protocols. We point out various optimisations and tricks, and compare timings of a pairing-based Identity Based Encryption scheme with an optimised RSA implementation.
openaire   +1 more source

Tate homology with respect to cotorsion pairs

Communications in Algebra, 2018
Given two complete hereditary cotorsion pairs (𝒬,ℛ) and (𝒬′,ℛ′) in the category of modules which satisfy the conditions 𝒬′⊆𝒬, 𝒬∩ℛ=𝒬′∩ℛ′, and ℛ′ is enveloping, a kind of Tate homology Tor∗𝒬ℳ of mod...
Zhenxing Di, Zhongkui Liu, Xiaoxiang Zhang   +2 more
openaire   +1 more source

Efficient Implementation of Tate Pairing with Montgomery Ladder Method

2013 5th International Conference on Intelligent Networking and Collaborative Systems, 2013
The basic algorithm used in pairing computation was first described by Miller and this algorithm can be named double-and-add and line-and-tangle algorithm. We will describe, in detail sufficient, a variant of Miller's which will replace double-and-add method with Montgomery ladder method.
Yulong Tian, Dawu Gu, Haihua Gu
openaire   +1 more source

Tate Pairing Computation on Generalized Hessian Curves

2012
In this paper, we present explicit formulae for Miller’s algorithm to compute the Tate pairing on generalized Hessian curves using projective coordinates. Firstly, we propose the geometric interpretation of the group law and construct Miller function on generalized Hessian curves.
Liangze Li, Fan Zhang
openaire   +1 more source