Results 1  10
of
23
A New Approach to Subquadratic Space Complexity Parallel Multipliers for Extended Binary Fields
 IEEE Trans. Computers
, 2007
"... ..."
Overlapfree KaratsubaOfman polynomial multiplication algorithms
 Information Security, IET
, 2010
"... ..."
Asymmetric squaring formulae
, 2006
"... We present efficient squaring formulae based on the ToomCook multiplication algorithm. The latter always requires at least one nontrivial constant division in the interpolation step. We show such nontrivial divisions are not needed in the case two operands are equal for three, four and fiveway s ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
We present efficient squaring formulae based on the ToomCook multiplication algorithm. The latter always requires at least one nontrivial constant division in the interpolation step. We show such nontrivial divisions are not needed in the case two operands are equal for three, four and fiveway squarings. Our analysis shows that our 3way squaring algorithms have much less overhead than the best known 3way ToomCook algorithm. Our experimental results show that one of our new 3way squaring methods performs faster than mpz_mul() in GNU multiple precision library (GMP) for squaring integers of approximately 2400–6700 bits on Pentium IV Prescott 3.2GHz. For squaring in Z[x], our 3way squaring algorithms are much superior to other known squaring algorithms for small input size. In addition, we present 4way and 5way squaring formulae which do not require any constant divisions by integers other than a power of 2. Under some reasonable assumptions, our 5way squaring formula is faster than the recently proposed Montgomery’s 5way Karatsubalike formulae. Keywords: Squaring, Karatsuba algorithm, Toom
Subquadratic Computational Complexity Schemes for Extended Binary Field Multiplication Using Optimal Normal Bases
, 2007
"... Based on a recently proposed Toeplitz matrixvector product approach, a subquadratic computational complexity scheme is presented for multiplications in binary extended finite fields using Type I and II optimal normal bases. basis. Index Terms Finite field, subquadratic computational complexity mult ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
Based on a recently proposed Toeplitz matrixvector product approach, a subquadratic computational complexity scheme is presented for multiplications in binary extended finite fields using Type I and II optimal normal bases. basis. Index Terms Finite field, subquadratic computational complexity multiplication, normal basis, optimal normal
Parallel Montgomery Multiplication in GF(2 k ) Using Trinomial Residue Arithmetic
 In 17th IEEE Symposium on Computer Arithmetic (ARITH05
, 2005
"... We propose the first general multiplication algorithm in GF(2 k) with a subquadratic area complexity of O(k 8/5) = O(k 1.6). Using the Chinese Remainder Theorem, we represent the elements of GF(2 k); i.e. the polynomials in GF(2)[X] of degree at most k − 1, by their remainder modulo a set of n pair ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
We propose the first general multiplication algorithm in GF(2 k) with a subquadratic area complexity of O(k 8/5) = O(k 1.6). Using the Chinese Remainder Theorem, we represent the elements of GF(2 k); i.e. the polynomials in GF(2)[X] of degree at most k − 1, by their remainder modulo a set of n pairwise prime trinomials, T1,..., Tn, of degree d and such that nd ≥ k. Our algorithm is based on Montgomery’s multiplication applied to the ring formed by the direct product of the trinomials.
1 Block Recombination Approach for Subquadratic Space Complexity Binary Field Multiplication based on Toeplitz MatrixVector Product
"... In this paper, we present a new method for parallel binary finite field multiplication which results in subquadratic space complexity. The method is based on decomposing the building blocks of FanHasan subquadratic Toeplitz matrixvector multiplier. We reduce the space complexity of their architect ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
In this paper, we present a new method for parallel binary finite field multiplication which results in subquadratic space complexity. The method is based on decomposing the building blocks of FanHasan subquadratic Toeplitz matrixvector multiplier. We reduce the space complexity of their architecture by recombining the building blocks. In comparison to other similar schemes available in the literature, our proposal presents a better space complexity while having the same time complexity. We also show that block recombination can be used for efficient implementation of the GHASH function of Galois Counter Mode (GCM).
Comments on “five, Six, and SevenTerm KaratsubaLike Formulae
 IEEE Transactions on Computers
, 2007
"... We show that multiplication complexities of nterm KaratsubaLike formulae of GF (2)[x] (7 < n < 19) presented in the above paper can be further improved using the Chinese Remainder Theorem and the construction multiplication modulo (x − ∞) w. Index Terms Karatsuba algorithm, polynomial multip ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
We show that multiplication complexities of nterm KaratsubaLike formulae of GF (2)[x] (7 < n < 19) presented in the above paper can be further improved using the Chinese Remainder Theorem and the construction multiplication modulo (x − ∞) w. Index Terms Karatsuba algorithm, polynomial multiplication, finite field.
Parallel Montgomery Multiplication in GF(2^k) using Trinomial Residue Arithmetic
 Proceedings 17th IEEE Symposium on computer Arithmetic
, 2005
"... Abstract We propose the first general multiplication algorithm in GF(2k) with a subquadratic area complexity of O(k8/5) = O(k1.6). Using the Chinese Remainder Theorem, we represent the elements of GF(2k); i.e. the polynomials in GF(2)[X] of degree at most k 1, by their remainder modulo a set of n ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract We propose the first general multiplication algorithm in GF(2k) with a subquadratic area complexity of O(k8/5) = O(k1.6). Using the Chinese Remainder Theorem, we represent the elements of GF(2k); i.e. the polynomials in GF(2)[X] of degree at most k 1, by their remainder modulo a set of n pairwise prime trinomials, T1,..., Tn, of degree d and such that nd> = k. Our algorithm is based on Montgomery's multiplication applied to the ring formed by the direct product of the trinomials.
Towards Faster and Greener Cryptoprocessor for Eta Pairing on Supersingular Elliptic Curve over F21223 ∗
"... Abstract. For the first time ever, the FPGA based cryptoprocessor presented in [12] makes it possible to compute an eta pairing at the 128bit security level in less than one millisecond. The high performance of their cryptoprocessor comes largely from the use of the Karatsuba method for field multi ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. For the first time ever, the FPGA based cryptoprocessor presented in [12] makes it possible to compute an eta pairing at the 128bit security level in less than one millisecond. The high performance of their cryptoprocessor comes largely from the use of the Karatsuba method for field multiplication. In this article, for the same type of pairing we propose hybrid sequential/parallel multipliers based on the Toeplitz matrixvector products and present some optimizations for the final exponentiation, resulting in high performance cryptoprocessors. On the same kind of FPGA devices, our cryptoprocessor performs pairing faster than that of [12] while requiring less hardware resources. We also present ASIC implementations and report that the threeway split multiplier based cryptoprocessor consumes less energy than the twoway. Moreover, by taking advantage of the area efficiency of the Toeplitz matrixvector product approach, we are able to deploy additional hardware to concurrently perform two multiplications with one common input, completing a pairing operation in less than 88 µs and 48 µs (i.e., about 11K and 21K pairing operations per second) in FPGA and ASIC, respectively. 1
Low Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation
, 2013
"... We study Dickson bases for binary field representation. Such a representation seems interesting when no optimal normal basis exists for the field. We express the product of two field elements as Toeplitz or Hankel matrixvector products. This provides a parallel multiplier which is subquadratic in s ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We study Dickson bases for binary field representation. Such a representation seems interesting when no optimal normal basis exists for the field. We express the product of two field elements as Toeplitz or Hankel matrixvector products. This provides a parallel multiplier which is subquadratic in space and logarithmic in time. Using the matrixvector formulation of the field multiplication, we also present sequential multiplier structures with linear space complexity.