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
Let arithmetic pseudo-NC^k denote the problems that can be solved by log space uniform arithmetic c...
AbstractEfficient circuits are described for multiplying in GF(2m) for m taking on values from the s...
In this paper we present a new, heuristic method for computing logarithms over GF(2P). When 2P-1 is ...
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...
AbstractStandard methods for calculating over GF(pn), the finite field of pn elements, require an ir...
We will give algorithms of computing bases of logarithmic cohomology groups for square-free polynom...
AbstractThe paper is devoted to some results concerning the constructive theory of the synthesis of ...
In this paper, we revisit the ZigZag strategy of Granger, Kleinjung and Zumbrägel. In particular, we...
A new proof is given for the correctness of the powers of two descent method for computing discrete ...
Methods of generating irreducible polynomials from a given minimal polynomial are known. However, wh...
AbstractWe deduce exact formulas for polynomials representing the Lucas logarithm and prove lower bo...
AbstractWe give a conjectural deterministic algorithm for computing primitive elements of extensions...
We consider polynomials p(x) over the 2-element field F2. If p(x) of degree n is irreducible, then a...
In this paper a new approach to the problem of generating irreducible polynomials from a given minim...
Let arithmetic pseudo-NC^k denote the problems that can be solved by log space uniform arithmetic c...
AbstractEfficient circuits are described for multiplying in GF(2m) for m taking on values from the s...
In this paper we present a new, heuristic method for computing logarithms over GF(2P). When 2P-1 is ...
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...
AbstractStandard methods for calculating over GF(pn), the finite field of pn elements, require an ir...
We will give algorithms of computing bases of logarithmic cohomology groups for square-free polynom...
AbstractThe paper is devoted to some results concerning the constructive theory of the synthesis of ...
In this paper, we revisit the ZigZag strategy of Granger, Kleinjung and Zumbrägel. In particular, we...
A new proof is given for the correctness of the powers of two descent method for computing discrete ...
Methods of generating irreducible polynomials from a given minimal polynomial are known. However, wh...
AbstractWe deduce exact formulas for polynomials representing the Lucas logarithm and prove lower bo...
AbstractWe give a conjectural deterministic algorithm for computing primitive elements of extensions...
We consider polynomials p(x) over the 2-element field F2. If p(x) of degree n is irreducible, then a...
In this paper a new approach to the problem of generating irreducible polynomials from a given minim...
Let arithmetic pseudo-NC^k denote the problems that can be solved by log space uniform arithmetic c...
AbstractEfficient circuits are described for multiplying in GF(2m) for m taking on values from the s...
In this paper we present a new, heuristic method for computing logarithms over GF(2P). When 2P-1 is ...
DOI
Add to ORKG