搜索结果: 1-15 共查到“军事学 Tate Pairing”相关记录17条 . 查询时间(0.156 秒)
Miller Inversion is Easy for the Reduced Tate Pairing on Trace Zero Supersingular Curves
elliptic curve cryptosystem pairing inversion Tate pairing
2019/4/16
We present a simple algorithm for Miller inversion for the reduced Tate pairing on supersingular elliptic curve of trace zero defined over the finite fields with q elements. Our algorithm runs with O(...
Compact hardware for computing the Tate pairing over 128-bit-security supersingular curves
implementation Tate pairing supersingular elliptic curves FPGA implementation
2010/7/14
This paper presents a novel method for designing compact yet efficient hardware implementations of the Tate pairing over supersingular curves in small characteristic. Since such curves are usually res...
Multicore Implementation of the Tate Pairing over Supersingular Elliptic Curves
Tate pairing supersingular curve finite field arithmetic
2009/6/15
This paper describes the design of a fast multicore library
for the cryptographic Tate pairing over supersingular elliptic curves. We
report a calculation time of just 3:15 ms and 1:87 ms on the Int...
Hardware Accelerator for the Tate Pairing in Characteristic Three Based on Karatsuba-Ofman Multipliers
Tate pairing T pairing elliptic curve
2009/6/12
This paper is devoted to the design of fast parallel accelerators
for the cryptographic Tate pairing in characteristic three over
supersingular elliptic curves. We propose here a novel hardware impl...
A Comparison Between Hardware Accelerators for the Modified Tate Pairing over F2m and F3m
modified Tate pairing finite field arithmetic elliptic curve
2009/6/3
In this article we propose a study of the modified Tate pairing
in characteristics two and three. Starting from the T pairing introduced
by Barreto et al. [1], we detail various algorithmic improvem...
Efficient Tate Pairing Computation for Supersingular Elliptic Curves over Binary Fields
supersingular elliptic curve Tate pairing divisor
2009/4/1
After Miller's original algorithm for the Tate pairing computation, many improved
algorithms have been suggested, to name just a few, by Galbraith et al. and Barreto et al.,
especially for the field...
Refinements of Miller’s Algorithm for Computing Weil/Tate Pairing
algorithm elliptic curve cryptography Weil/Tate pairing
2009/3/24
In this paper we propose three refinements to Miller’s algorithm for computing
Weil/Tate Pairing. The first one is an overall improvement and achieves
its optimal behavior if the binary expansion of...
Computation of Tate Pairing for Supersingular Curves over characteristic 5 and 7
Tate pairing continued fraction Frobenius Endomorphism supersingular
2009/3/11
We compute Tate pairing over supersingular elliptic curves via the generic BGhES[3]
method for p = 5; 7. In those cases, the point multiplication by p is e±ciently
computed by the Frobenius endomorp...
Powered Tate pairing computation
Powered Tate pairing Tate pairing Bilinear map Elliptic Curve Cryptosystem
2009/2/23
In this paper, we introduce a powered Tate pairing on a supersingular elliptic
curve that has the same shortened loop as the modified Tate pairing using the eta pairing
approach by Barreto et al. Th...
Tate pairing computation on the divisors of hyperelliptic curves for cryptosystems
Tate pairing computation hyperelliptic curve cryptosystems pairing-based cryptosystems
2009/2/10
In recent papers [4] and [9], Barreto et al and Choie et al
worked on hyperelliptic curves Hb defined by y2 + y = x5 + x3 + b over
a finite field F2n with b = 0 or 1 for a secure and efficient pairi...
Efficient hardware for the Tate pairing calculation in characteristic three
Tate pairing hardware characteristic three tower fields
2009/1/19
In this paper the benefits of implementation of the Tate pair-
ing computation in dedicated hardware are discussed. The main obser-
vation lies in the fact that arithmetic architectures in the exten...
The Tate Pairing via Elliptic Nets
Tate pairing elliptic curve elliptic divisibility sequence
2008/12/29
We derive a new algorithm for computing the Tate pairing
on an elliptic curve over a finite field. The algorithm uses a generalisation
of elliptic divisibility sequences known as elliptic nets, whic...
Efficient Implementation of Tate Pairing on a Mobile Phone using Java
Tate Pairing Mobile Phone Java
2008/12/16
Efficient Implementation of Tate Pairing on a Mobile Phone using Java.
Efficient Tate Pairing Computation Using Double-Base Chains
Tate pairing Elliptic curves Double-base chains
2008/11/28
Pairing-based cryptosystems have been developing very fast
in the last few years. The efficiencies of the cryptosystems are determined
by the computation of the Tate pairing. In this paper a new eff...
FPGA Accelerated Tate Pairing Based Cryptosystems over Binary Fields
Tate pairing elliptic curve FPGA
2008/11/24
Though the implementation of the Tate pairing is commonly believed to be computationally more
intensive than other cryptographic operations, such as ECC point multiplication, there has been
a substa...