搜索结果: 1-14 共查到“军事学 characteristic three”相关记录14条 . 查询时间(0.171 秒)
Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields
discrete logarithm problem bilinear pairings cryptanalysis, implementation
2016/12/9
Since 2013 there have been several developments in algorithms for computing discrete logarithms in small-characteristic finite fields, culminating in a quasi-polynomial algorithm. In this paper, we re...
Faster Scalar Multiplication on Ordinary Weierstrass Elliptic Curves over Fields of Characteristic Three
Elliptic curve scalar multiplication unified addition cryptography explicit formulae
2012/3/26
This paper proposes new explicit formulae for the point doubling, tripling and addition on ordinary Weierstrass elliptic curves over finite fields of characteristic three. The cost of basic point oper...
Arithmetic of Supersingular Koblitz Curves in Characteristic Three
elliptic curve cryptosystem implementation supersingular Koblitz curves scalar multiplication
2010/8/17
We consider digital expansions of scalars for supersingular Koblitz curves in characteristic three. These are positional representations of integers to the base of $\tau$, where $\tau$ is a zero of th...
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 Fast Implementation of T Pairing in Characteristic Three on Intel Core 2 Duo Processor
T pairing parallel computing efficient implementation SSE
2009/6/11
We present an efficient implementation of T pairing on Intel Core 2 Duo
processor. The processing speed of our implementation achieves 92 sec
over F97 3 and 553 sec over F193 3 on 2.6GHz processor...
FPGA and ASIC Implementations of the $\eta_T$ Pairing in Characteristic Three
Tate pairing elliptic curve cryptography finite field arithmetic
2009/6/5
Since their introduction in constructive cryptographic
applications, pairings over (hyper)elliptic curves are at
the heart of an ever increasing number of protocols. As they rely
critically on effi...
Hardware and Software Normal Basis Arithmetic for Pairing Based Cryptography in Characteristic Three
Hardware and Software Normal Basis Arithmetic Pairing Based Cryptography Characteristic Three
2009/3/27
Although identity based cryptography o ers a number of
functional advantages over conventional public key methods, the computational
costs are significantly greater. The dominant part of this cost i...
An AGM-type elliptic curve point counting algorithm in characteristic three
elliptic curve finite field point counting cryptography
2009/3/20
Given an ordinary elliptic curve on Hesse form over a finite field
of characteristic three, we give a sequence of elliptic curves which leads to
an effective construction of the canonical lift, and ...
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...
An Algorithm for the $\eta_T$ Pairing Calculation in Characteristic Three and its Hardware Implementation
Tate pairing characteristic three elliptic curve
2008/12/19
n this paper, we propose a modified T pairing
algorithm in characteristic three which does not need any cube
root extraction. We also discuss its implementation on a low cost
platform which hosts a...
A Coprocessor for the Final Exponentiation of the $\eta_T$ Pairing in Characteristic Three
characteristic three final exponentiation hardware accelerator FPGA
2008/9/16
Since the introduction of pairings over (hyper)elliptic curves
in constructive cryptographic applications, an ever increasing number
of protocols based on pairings have appeared in the literature....
New Fast Algorithms for Arithmetic on Elliptic Curves over Finite Fields of Characteristic Three
characteristic three elliptic curve point addition point doubling
2008/8/28
In this paper we propose new formulae and algorithms for arithmetic on ordinary elliptic curve with a point of order 3 over finite field of characteristic three, by which the cost of a point multiplic...
A Refined Algorithm for the T Pairing Calculation in Characteristic Three
T pairing finite field arithmetic characteristic three
2008/5/30
We describe further improvements of the T pairing algorithm
in characteristic three. Our approach combines the loop unrolling
technique introduced by Granger et. al for the Duursma-Lee algorithm,
a...
Algorithms and Arithmetic Operators for Computing the nT Pairing in Characteristic Three
nT pairing finite field arithmetic elliptic curve,
2008/5/22
Since their introduction in constructive cryptographic
applications, pairings over (hyper)elliptic curves are at
the heart of an ever increasing number of protocols. Software
implementations being ...