AbstractWe present a method for expressing a root of one irreducible polynomial of degree n over GF(2) in terms of a basis of GF(2n) over GF(2) associated with another. This allows us, when both polynomials are primitive, to find logarithms relative to one polynomial from logarithms relative to the other
AbstractWe deduce exact formulas for polynomials representing the Lucas logarithm and prove lower bo...
AbstractThis paper proposes a fast algorithm for computing multiplicative inverses in GF(2m) using n...
We present an algorithm which converts a given Gröbner basis of a polynomial ideal I of arbitrary di...
AbstractWe present a method for expressing a root of one irreducible polynomial of degree n over GF(...
AbstractThis paper presents procedures for constructing irreducible polynomials over GF(2s) with lin...
finite field representation, optimal normal basis, palindromic representation A representation of th...
This report lists the primitive polynomials over GF(3) of degree 2 through 11. These polynomials wer...
In this paper we present a new, heuristic method for computing logarithms over GF(2P). When 2P-1 is ...
We present an algorithm which converts a given Gröbner basis of a polynomial ideal I to a Gröbner ba...
In this paper, we propose a new normal basis multiplication algorithm for GF(2 )
Methods of generating irreducible polynomials from a given minimal polynomial are known. However, wh...
Abstract. The problem of solving polynomial equations over finite fields has many ap-plications in c...
In the Galois fields GF(2n), a polynomial basis with a small number of trace-one elements is desirab...
This habilitation thesis deals with polynomial system solving through Gröbner bases computations. I...
We present a novel method of parallelization of the multiplication operation in GF(2 k) for an arbit...
AbstractWe deduce exact formulas for polynomials representing the Lucas logarithm and prove lower bo...
AbstractThis paper proposes a fast algorithm for computing multiplicative inverses in GF(2m) using n...
We present an algorithm which converts a given Gröbner basis of a polynomial ideal I of arbitrary di...
AbstractWe present a method for expressing a root of one irreducible polynomial of degree n over GF(...
AbstractThis paper presents procedures for constructing irreducible polynomials over GF(2s) with lin...
finite field representation, optimal normal basis, palindromic representation A representation of th...
This report lists the primitive polynomials over GF(3) of degree 2 through 11. These polynomials wer...
In this paper we present a new, heuristic method for computing logarithms over GF(2P). When 2P-1 is ...
We present an algorithm which converts a given Gröbner basis of a polynomial ideal I to a Gröbner ba...
In this paper, we propose a new normal basis multiplication algorithm for GF(2 )
Methods of generating irreducible polynomials from a given minimal polynomial are known. However, wh...
Abstract. The problem of solving polynomial equations over finite fields has many ap-plications in c...
In the Galois fields GF(2n), a polynomial basis with a small number of trace-one elements is desirab...
This habilitation thesis deals with polynomial system solving through Gröbner bases computations. I...
We present a novel method of parallelization of the multiplication operation in GF(2 k) for an arbit...
AbstractWe deduce exact formulas for polynomials representing the Lucas logarithm and prove lower bo...
AbstractThis paper proposes a fast algorithm for computing multiplicative inverses in GF(2m) using n...
We present an algorithm which converts a given Gröbner basis of a polynomial ideal I of arbitrary di...
DOI
Add to ORKG