搜索结果: 1-8 共查到“军事学 Normal Basis”相关记录8条 . 查询时间(0.064 秒)
High-speed VLSI implementation of Digit-serial Gaussian normal basis Multiplication over GF(2m)
Cryptography Logical Effort Gaussian Normal Basis multiplication
2016/12/8
In this paper, by employing the logical effort technique an efficient and high-speed VLSI implementation of the digit-serial Gaussian normal basis multiplier is presented. It is constructed by using A...
Hardware implementations of cryptographic algorithms are vulnerable to natural and malicious faults. Concurrent Error Detection (CED) can be used to detect these faults. We present NREPO, a CED which ...
Reducing the Complexity of Normal Basis Multiplication
Finite fields characteristic 2 normal basis
2016/1/7
In this paper we introduce a new transformation method and a multiplication algorithm for
multiplying the elements of the field GF(2k
) expressed in a normal basis. The number of XOR
gates for the ...
A Matrix Decomposition Method for Optimal Normal Basis Multiplication
Finite fields matrix decomposition method
2015/12/24
We introduce a matrix decomposition method and prove that multiplication in GF(2^k) with a Type 1 optimal normal basis for can be performed using k^2-1 XOR gates irrespective of the choice of the irre...
Efficient and Low-complexity Hardware Architecture of Gaussian Normal Basis Multiplication over GF(2m) for Elliptic Curve Cryptosystems
Finite Fields Elliptic Curve Cryptosystems Multiplication
2015/12/21
In this paper an efficient high-speed architecture of Gaussian normal basis multiplier over binary finite
field GF(2m) is presented. The structure is constructed by using regular modules for computat...
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...
Two Software Normal Basis Multiplication Algorithms for GF(2n)
Finite field normal basis multiplication algorithm
2009/3/27
In this paper, two different normal basis multiplication algorithms for software
implementation are proposed over GF(2n). The first algorithm is suitable for high complexity
normal bases and the sec...
Normal Basis Multiplication Algorithms for GF（2n）
Finite field normal basis Massey-Omura multiplier
2009/3/10
In this paper, we propose a new normal basis multiplication algorithm for GF(2n).
This algorithm can be used to design not only fast software algorithms but also low complexity
bit-parallel multipli...