搜索结果: 1-13 共查到“军队指挥学 Trinomials”相关记录13条 . 查询时间(0.031 秒)
On the Complexity of non-recursive $n$-term Karatsuba Multiplier for Trinomials
Bit-parallel multiplier nn-Karatsuba algorithm shifted polynomial basis
2019/2/27
In this paper, we continue the study of bit-parallel multiplier using a nn-term Karatsuba algorithm (KA), recently introduced by Li et al. (IEEE Access 2018). Such a nn-term KA is a generalization of ...
N-term Karatsuba Algorithm and its Application to Multiplier designs for Special Trinomials
N-term Karatsuba Algorithm Specific trinomials Bit-parallel Multiplier
2018/6/19
We show that such a type of trinomial combined with the nn-term KA can fully exploit the spatial correlation of entries in related Mastrovito product matrices and lead to a low complexity architecture...
We introduce a new type of Montgomery-like square root formulae in GF(2m)GF(2m) defined by an arbitrary irreducible trinomial, which is more efficient compared with classic square root operation. By c...
Mastrovito form of Karatsuba Multiplier for All Trinomials
Karatsuba multiplier Mastrovito shifted polynomial basis
2016/7/14
We present a Matrix-vector form of Karatsuba multiplication over GF(2m)GF(2m) generated by an irreducible trinomial. Based on shifted polynomial basis (SPB), two Mastrovito matrices for different Kara...
New bit-parallel Montgomery multiplier for trinomials using squaring operation
Montgomery multiplication squaring bit-parallel
2016/1/23
In this paper, a new bit-parallel Montgomery multiplier for GF(2m) is presented, where the field is generated with an irreducible trinomial. We first present a slightly generalized version of a newly...
In this paper, we explore the primitivity of trinomials over small finite fields. We extend the results of the primitivity of trinomials xn+ax+b over F4 \cite{Li} to the general form xn+axk+b. We prov...
A Chinese Remainder Theorem Approach to Bit-Parallel GF(2^n) Polynomial Basis Multipliers for Irreducible Trinomials
implementation Irreducible Trinomials
2016/1/5
We show that the step “modulo the degree-n field generating irreducible polynomial” in the classical definition of the GF(2^n) multiplication operation can be avoided. This leads to an alternative rep...
Low Space Complexity CRT-based Bit-Parallel GF(2^n) Polynomial Basis Multipliers for Irreducible Trinomials
Finite field multiplication polynomial basis
2015/12/30
By selecting the largest possible value of k∈(n/2,2n/3], we further reduce the AND and XOR gate complexities of the CRT-based hybrid parallel GF(2^n) polynomial basis multipliers for the irreduc...
In this paper, we give conditions under which the trinomials of the form $x^{n}+ax+b$ over finite field ${\mathbb{F}}_{p^{m}}$ are not primitive and conditions under which there are no primitive trino...
REDUNDANT TRINOMIALS FOR FINITE FIELDS OF CHARACTERISTIC 2
finite fields arithmetic Elliptic curve cryptography
2009/3/24
In this paper we introduce so-called redundant trinomials to represent
elements of nite elds of characteristic 2. The concept is in fact similar
to almost irreducible trinomials introduced by Bren...
Low Complexity Bit-Parallel Square Root Computation over GF(2m) for all Trinomials
Finite field arithmetic binary extension fields cryptography
2008/11/13
In this contribution we introduce a low-complexity bit-parallel algorithm
for computing square roots over binary extension fields. Our proposed
method can be applied for any type of irreducible poly...
Parallel Itoh-Tsujii Multiplicative Inversion Algorithm for a Special Class of Trinomials
Parallel Itoh-Tsujii Multiplicative Inversion Algorithm Trinomials
2008/10/24
In this contribution, we derive a novel parallel formulation of the standard
Itoh-Tsujii algorithm for multiplicative inverse computation over GF(2m).
The main building blocks used by our algorithm ...
Classes of Quadratic APN Trinomials and Hexanomials and Related Structures
Affine equivalence Almost bent, Almost perfect nonlinear CCZ-equivalence
2008/9/9
A method for constructing differentially 4-uniform quadratic hexanomials has
been recently introduced by J. Dillon. We give various generalizations of this method
and we deduce the constructions of ...