Displaying 421 – 440 of 1964

Showing per page

A monogenic Hasse-Arf theorem

James Borger (2004)

Journal de Théorie des Nombres de Bordeaux

I extend the Hasse–Arf theorem from residually separable extensions of complete discrete valuation rings to monogenic extensions.

A necessary and sufficient condition for the primality of Fermat numbers

Michal Křížek, Lawrence Somer (2001)

Mathematica Bohemica

We examine primitive roots modulo the Fermat number F m = 2 2 m + 1 . We show that an odd integer n 3 is a Fermat prime if and only if the set of primitive roots modulo n is equal to the set of quadratic non-residues modulo n . This result is extended to primitive roots modulo twice a Fermat number.

A new approach to the ElGamal encryption scheme

Czesław Kościelny (2004)

International Journal of Applied Mathematics and Computer Science

The ElGamal encryption scheme can be used for both digital signatures and encryption, and its security results from the difficulty of calculating discrete logarithms in a finite field. This algorithm usually works in a multiplicative group of GF(p) and in this case the progress in the discrete logarithm problem forces the users of such a basic ElGamal public key cryptosystem to permanently increase a prime modulus p in order to ensure the desired security. But the task of finding a multiplicative...

Currently displaying 421 – 440 of 1964