59,805 research outputs found
Efficient Bit-parallel Multiplication with Subquadratic Space Complexity in Binary Extension Field
Bit-parallel multiplication in GF(2^n) with subquadratic space complexity has been explored in recent years due to its lower area cost compared with traditional parallel multiplications. Based on \u27divide and conquer\u27 technique, several algorithms have been proposed to build subquadratic space complexity multipliers. Among them, Karatsuba algorithm and its generalizations are most often used to construct multiplication architectures with significantly improved efficiency. However, recursively using one type of Karatsuba formula may not result in an optimal structure for many finite fields. It has been shown that improvements on multiplier complexity can be achieved by using a combination of several methods. After completion of a detailed study of existing subquadratic multipliers, this thesis has proposed a new algorithm to find the best combination of selected methods through comprehensive search for constructing polynomial multiplication over GF(2^n). Using this algorithm, ameliorated architectures with shortened critical path or reduced gates cost will be obtained for the given value of n, where n is in the range of [126, 600] reflecting the key size for current cryptographic applications. With different input constraints the proposed algorithm can also yield subquadratic space multiplier architectures optimized for trade-offs between space and time. Optimized multiplication architectures over NIST recommended fields generated from the proposed algorithm are presented and analyzed in detail. Compared with existing works with subquadratic space complexity, the proposed architectures are highly modular and have improved efficiency on space or time complexity. Finally generalization of the proposed algorithm to be suitable for much larger size of fields discussed
The Gaussian normal basis and its trace basis over finite fields
AbstractIt is well known that normal bases are useful for implementations of finite fields in various applications including coding theory, cryptography, signal processing, and so on. In particular, optimal normal bases are desirable. When no optimal normal basis exists, it is useful to have normal bases with low complexity. In this paper, we study the type k(⩾1) Gaussian normal basis N of the finite field extension Fqn/Fq, which is a classical normal basis with low complexity. By studying the multiplication table of N, we obtain the dual basis of N and the trace basis of N via arbitrary medium subfields Fqm/Fq with m|n and 1⩽m⩽n. And then we determine all self-dual Gaussian normal bases. As an application, we obtain the precise multiplication table and the complexity of the type 2 Gaussian normal basis and then determine all optimal type 2 Gaussian normal bases
CONSTRUCTION OF ASYMMETRIC CHUDNOVSKY ALGORITHMS WITHOUT DERIVATED EVALUATION FOR MULTIPLICATION IN FINITE FIELDS
The Chudnovsky and Chudnovsky algorithm for the multiplication in extensions of finite fields provides a bilinear complexity which is uniformly linear with respect to the degree of the extension. Recently, Ran-driambololona has generalized the method, allowing asymmetry in the interpolation procedure and leading to new upper bounds on the bilinear complexity. In this article, we first translate this generalization into the language of algebraic function fields. Then, we propose a strategy to effectively construct asymmetric algorithms using places of higher degrees and without derivated evaluation. Finally, we provide examples of three multiplication algorithms along with their Magma implementation: in F 16 13 using only rational places, in F 4 5 using also places of degree two, and in F 2 5 using also places of degree four
Novel Polynomial Basis and Its Application to Reed-Solomon Erasure Codes
In this paper, we present a new basis of polynomial over finite fields of
characteristic two and then apply it to the encoding/decoding of Reed-Solomon
erasure codes. The proposed polynomial basis allows that -point polynomial
evaluation can be computed in finite field operations with
small leading constant. As compared with the canonical polynomial basis, the
proposed basis improves the arithmetic complexity of addition, multiplication,
and the determination of polynomial degree from
to . Based on this basis, we then develop the encoding and
erasure decoding algorithms for the Reed-Solomon codes. Thanks to
the efficiency of transform based on the polynomial basis, the encoding can be
completed in finite field operations, and the erasure decoding
in finite field operations. To the best of our knowledge, this
is the first approach supporting Reed-Solomon erasure codes over
characteristic-2 finite fields while achieving a complexity of ,
in both additive and multiplicative complexities. As the complexity leading
factor is small, the algorithms are advantageous in practical applications
Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method
We give new improvements to the Chudnovsky-Chudnovsky method that provides
upper bounds on the bilinear complexity of multiplication in extensions of
finite fields through interpolation on algebraic curves. Our approach features
three independent key ingredients:
(1) We allow asymmetry in the interpolation procedure. This allows to prove,
via the usual cardinality argument, the existence of auxiliary divisors needed
for the bounds, up to optimal degree.
(2) We give an alternative proof for the existence of these auxiliary
divisors, which is constructive, and works also in the symmetric case, although
it requires the curves to have sufficiently many points.
(3) We allow the method to deal not only with extensions of finite fields,
but more generally with monogenous algebras over finite fields. This leads to
sharper bounds, and is designed also to combine well with base field descent
arguments in case the curves do not have sufficiently many points.
As a main application of these techniques, we fix errors in, improve, and
generalize, previous works of Shparlinski-Tsfasman-Vladut, Ballet, and
Cenk-Ozbudak. Besides, generalities on interpolation systems, as well as on
symmetric and asymmetric bilinear complexity, are also discussed.Comment: 40 pages; difference with previous version: modified Lemma 5.
Distributed matrix multiplication with straggler tolerance using algebraic function fields
The problem of straggler mitigation in distributed matrix multiplication
(DMM) is considered for a large number of worker nodes and a fixed small finite
field. Polynomial codes and matdot codes are generalized by making use of
algebraic function fields (i.e., algebraic functions over an algebraic curve)
over a finite field. The construction of optimal solutions is translated to a
combinatorial problem on the Weierstrass semigroups of the corresponding
algebraic curves. Optimal or almost optimal solutions are provided. These have
the same computational complexity per worker as classical polynomial and matdot
codes, and their recovery thresholds are almost optimal in the asymptotic
regime (growing number of workers and a fixed finite field)
Hardware Implementation of Bit-Parallel Finite Field Multipliers Based on Overlap-free Algorithm on FPGA
Cryptography can be divided into two fundamentally different classes: symmetric-key and public-key. Compared with symmetric-key cryptography, where the complexity of the security system relies on a single key between receiver and sender, public-key cryptographic system using two separate but mathematically related keys. Finite field multiplication is a key operation used in all cryptographic systems relied on finite field arithmetic as it not only is computationally complex but also one of the most frequently used finite field operations. Karatsuba algorithm and its generalization are most often used to construct multiplication architectures with significantly improved in these decades. However, one of its optimized architecture called Overlap-free Karatsuba algorithm has been mentioned by fewer people and even its implementation on FPGA has not been mentioned by anyone. After completion of a detailed study of this specific algorithm, this thesis has proposed implementation of modified Overlap-free Karatsuba algorithm on Xilinx Spartan-605. Applied this algorithm and its specific architecture, reduced gates or shorten critical path will be achieved for the given value of n.Optimized multiplication architecture, generated from proposed modified Overlap-free Karatsuba algorithm and applied on FPGA board,over NIST recommended fields (n = 128), are presented and analysed in detail. Compared with existing works with sub-quadratic space and time complexities, the proposed modified algorithm is highly recommended module and have improved on both space and time complexities. At last, generalization of proposed modified algorithm is suitable for much larger size of finite fields, and improvements of FPGA itself have been discussed
- …