搜索结果: 1-11 共查到“军事学 Karatsuba”相关记录11条 . 查询时间(0.077 秒)
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...
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...
There are a variety of ways of applying the Karatsuba idea to multi-digit multiplication. These apply particularly well in the context where digits do not use the full word-length of the computer, so ...
This paper introduces constant-time ARM Cortex-A8 ECDH
software that (1) is faster than the fastest ECDH option in the latest
version of OpenSSL but (2) achieves a security level above 2200 using a
...
Optimized Karatsuba Squaring on 8-bit AVR Processors
Multi-Precision Squaring AVR Karatsuba
2016/1/6
Multi-precision squaring is a crucial operation for implementation of Elliptic
Curve Cryptography. Particularly, when it comes to embedded processors, the
operation should be designed carefully to e...
Obtaining More Karatsuba-Like Formulae over the Binary Field
Karatsuba algorithm polynomial multiplication Chinese remainder theorem
2010/1/18
The aim of this paper is to find more Karatsuba-like formulae for a fixed set of moduli polynomials
in GF(2)[x]. To this end, a theoretical framework is established. We first generalize the division
...
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 Pipelined Karatsuba-Ofman Multiplier over GF(397)Amenable for Pairing Computation
Finite field arithmetic Field Multiplier cryptography
2009/6/3
We present a subquadratic ternary field multiplier based on the combination
of several variants of the Karatsuba-Ofman scheme recently published.
Since one of the most relevant applications for this...
Generalizations of the Karatsuba Algorithm for Efficient Implementations
polynomial multiplication Karatsuba Algorithm finite fields
2008/12/3
In this work we generalize the classical Karatsuba Algorithm (KA) for polynomial multiplica-
tion to (i) polynomials of arbitrary degree and (ii) recursive use. We determine exact complexity expressi...
Overlap-free Karatsuba-Ofman Polynomial Multiplication Algorithm
Karatsuba algorithm Karatsuba-Ofman algorithm polynomial multiplication
2008/5/26
We describe how a recently proposed way to split input operands allows for fast VLSI implementations of GF(2)[x] Karatsuba-Ofman multipliers. The XOR gate delay of the proposed multiplier is better th...