Displaying 61 – 80 of 563

Showing per page

On Alternatives of Polynomial Congruences

Mariusz Skałba (2004)

Bulletin of the Polish Academy of Sciences. Mathematics

What should be assumed about the integral polynomials f ( x ) , . . . , f k ( x ) in order that the solvability of the congruence f ( x ) f ( x ) f k ( x ) 0 ( m o d p ) for sufficiently large primes p implies the solvability of the equation f ( x ) f ( x ) f k ( x ) = 0 in integers x? We provide some explicit characterizations for the cases when f j ( x ) are binomials or have cyclic splitting fields.

On an approximation property of Pisot numbers II

Toufik Zaïmi (2004)

Journal de Théorie des Nombres de Bordeaux

Let q be a complex number, m be a positive rational integer and l m ( q ) = inf { P ( q ) , P m [ X ] , P ( q ) 0 } , where m [ X ] denotes the set of polynomials with rational integer coefficients of absolute value m . We determine in this note the maximum of the quantities l m ( q ) when q runs through the interval ] m , m + 1 [ . We also show that if q is a non-real number of modulus > 1 , then q is a complex Pisot number if and only if l m ( q ) > 0 for all m .

On an iterated construction of irreducible polynomials over finite fields of even characteristic by Kyuregyan

Simone Ugolini (2016)

Czechoslovak Mathematical Journal

We deal with the construction of sequences of irreducible polynomials with coefficients in finite fields of even characteristic. We rely upon a transformation used by Kyuregyan in 2002, which generalizes the Q -transform employed previously by Varshamov and Garakov (1969) as well as by Meyn (1990) for the synthesis of irreducible polynomials. While in the iterative procedure described by Kyuregyan the coefficients of the initial polynomial of the sequence have to satisfy certain hypotheses, in the...

On Bilinear Structures on Divisor Class Groups

Gerhard Frey (2009)

Annales mathématiques Blaise Pascal

It is well known that duality theorems are of utmost importance for the arithmetic of local and global fields and that Brauer groups appear in this context unavoidably. The key word here is class field theory.In this paper we want to make evident that these topics play an important role in public key cryptopgraphy, too. Here the key words are Discrete Logarithm systems with bilinear structures.Almost all public key crypto systems used today based on discrete logarithms use the ideal class groups...

Currently displaying 61 – 80 of 563