Results 141 to 150 of about 1,830 (178)

Implementation of Cryptosystems Based on Tate Pairing

Journal of Computer Science and Technology, 2005
Tate pairings over elliptic curves are important in cryptography since they can be used to construct efficient identity-based cryptosystems, and their implementation dominantly determines the efficiencies of the cryptosystems. In this paper, the implementation of a cryptosystem is provided based on the Tate pairing over a supersingular elliptic curve ...
Lei Hu
exaly   +2 more sources

A method for efficient parallel computation of Tate pairing

International Journal of Grid and Utility Computing, 2012
The calculation of pairing plays a key role in pairing-based cryptography. Usually, the calculation is based on Miller's algorithm. However, most of the optimisations of Miller's algorithm are of serial structure. In this paper, we propose a method to parallel compute Tate pairing efficiently. We split the divisor in Miller's algorithm into three parts.
Hui Li, Jianfeng Ma
exaly   +2 more sources

Hardware architectures for the Tate pairing over GF(2m)

Computers and Electrical Engineering, 2007
In this paper two different approaches to the design of a reconfigurable Tate pairing hardware accelerator are presented. The first uses macro components based on a large, fixed number of underlying Galois Field arithmetic units in parallel to minimise the computation time.
William Marnane
exaly   +2 more sources

Refinements of Miller's algorithm for computing the Weil/Tate pairing

Journal of Algorithms, 2006
The efficient computation of the Weil and Tate pairings is of significant interest in the implementation of certain recently developed cryptographic protocols. The standard method of such computations has been the Miller algorithm. Three refinements to Miller's algorithm are given in this work. The first refinement is an overall improvement.
Ian F Blake, V Kumar Murty
exaly   +2 more sources

Efficient Algorithms for Tate Pairing

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2006
This paper presents new algorithms for the Tate pairing on a prime field. Recently, many pairing-based cryptographic schemes have been proposed. However, computing pairings incurs a high computational cost and represents the bottleneck to using pairings in actual protocols. This paper shows that the proposed algorithms reduce the cost of multiplication
Tetsutaro Kobayashi, Kazumaro Aoki, Hideki Imai   +2 more
openaire   +1 more source

Parallel Hardware Architectures for the Cryptographic Tate Pairing [PDF]

Third International Conference on Information Technology: New Generations (ITNG'06), 2006
Identity-based cryptography uses pairing functions, which are sophisticated bilinear maps defined on elliptic curves. Computing pairings efficiently in software is presently a relevant research topic. Since such functions are very complex and slow in software, dedicated hardware (HW) implementations are worthy of being studied, but presently only very ...
Guido Bertoni, Luca Breveglieri, Pasqualina Fragneto, Gerardo Pelosi   +3 more
openaire   +1 more source

Implementation And Optimization For Tate Pairing

Intelligent Automation & Soft Computing, 2011
Abstract Tate pairings has found several new applications in cryptography. However, how to compute Tate pairing is a research focus in all kinds of applications of pairing-based cryptosysterns (PBC). In the paper, the structure of Miller's algorithm is firstly analyzed, which is used to implement Tate pairing. Based on the characteristics that Miller's
Guangming Dai, Maocai Wang, Lei Peng 0001, Ruijie Qin   +3 more
openaire   +1 more source