搜索结果: 1-11 共查到“军队指挥学 binary fields”相关记录11条 . 查询时间(0.062 秒)
A new class of irreducible pentanomials for polynomial based multipliers in binary fields
irreducible pentanomials polynomial multiplication modular reduction
font style='font-size:12px;'>
2018/6/5
We give the total cost of the multiplier and found that the bit-parallel multiplier defined by this new class of polynomials has improved XOR and AND complexity. Our multiplier has comparable time del...
Fast Scalar Multiplication for Elliptic Curves over Binary Fields by Efficiently Computable Formulas
binary elliptic curves point multiplication lambda coordinates
font style='font-size:12px;'>
2017/9/7
This paper considers efficient scalar multiplication of elliptic curves over binary fields with a twofold purpose. Firstly, we derive the most efficient 3P3P formula in λλ-projective coordinates and 5...
Homomorphic Signatures over Binary Fields: Secure Network Coding with Small Coefficients
Lattice-based cryptography homomorphic signatures network coding
font style='font-size:12px;'>
2010/8/26
We propose a new signature scheme that can be used to authenticate data and prevent pollution attacks in networks that use network coding. At its core, our system is a homomorphic signature scheme tha...
EFFICIENT HALVING FOR GENUS 3 CURVES OVER BINARY FIELDS
Efficient Halving Genus 3 Curves Binary Fields
font style='font-size:12px;'>
2009/6/12
In this article, we deal with fast arithmetic in the Picard group
of hyperelliptic curves of genus 3 over binary fields. We investigate both the
optimal performance curves, where h(x) = 1, and the m...
ANALYZING THE GALBRAITH-LIN-SCOTT POINT MULTIPLICATION METHOD FOR ELLIPTIC CURVES OVER BINARY FIELDS
Galbraith-Lin-Scott Point Multiplication Method Elliptic Curves Binary Fields
font style='font-size:12px;'>
2009/6/5
Galbraith, Lin and Scott recently constructed efficiently-computable endomorphisms
for a large family of elliptic curves defined over Fq2 and showed, in the case where q is prime, that
the Gallant-L...
Fast Multiple Point Multiplication on Elliptic Curves over Prime and Binary Fields using the Double-Base Number System
Fast Multiple Point Multiplication Elliptic Curves Prime and Binary Fields Double-Base Number System
font style='font-size:12px;'>
2009/6/3
Multiple-point multiplication on elliptic curves is
the highest computational complex operation in the elliptic curve
cyptographic based digital signature schemes. We describe three
algorithms for ...
Efficient Tate Pairing Computation for Supersingular Elliptic Curves over Binary Fields
supersingular elliptic curve Tate pairing divisor
font style='font-size:12px;'>
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...
Efficient Doubling on Genus 3 Curves over Binary Fields
Genus 3 Hyperelliptic Curve Explicit Doubling Formulae Fast Arithmetic
font style='font-size:12px;'>
2009/2/18
The most important and expensive operation in a hyperelliptic curve cryptosystem
(HECC) is scalar multiplication by an integer k, i.e., computing an integer k times a divisor D on the Jacobian. Using...
Side Channel Attacks and Countermeasures on Pairing Based Cryptosystems over Binary Fields
Pairing based cryptosystems Side channel attacks Randomized projective coordinate systems
font style='font-size:12px;'>
2008/12/8
Pairings on elliptic curves have been used as cryptographic
primitives for the development of new applications such as identity based
schemes. For the practical applications, it is crucial to provi...
FPGA Accelerated Tate Pairing Based Cryptosystems over Binary Fields
Tate pairing elliptic curve FPGA
font style='font-size:12px;'>
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...
A New Method for Speeding Up Arithmetic on Elliptic Curves over Binary Fields
ECC(elliptic curve cryptosystem) binary field point doubling
font style='font-size:12px;'>
2008/8/28
Now, It is believed that the best costs of a point doubling and addition on elliptic curves over binary fields are SM54+ (namely, four finite field multiplications and five field squarings) and , resp...