We show how the theory of real quadratic congruence function fields can be used to produce a secure key distribution protocol. The technique is similar to that advocated by Diffie and Hellman inâ€¦ (More)

In 1976 Diffie and Hellman first introduced their well-known key-exchange protocol which is based on exponentiation in the multiplicative group GF(p)* of integers relatively prime to a large primepâ€¦ (More)

This paper presents an investigative account of arbitrary cubic function fields. We present an elementary classification of the signature of a cubic extension of a rational function field of finiteâ€¦ (More)

This paper investigates the arithmetic of fractional ideals of a purely cubic function field and the infrastructure of the principal ideal class when the field has unit rank one. First, we describeâ€¦ (More)

While it is well-known that the RSA public-key cryptosystem can be broken if its modulus N can be factored, it is not known whether there are other ways of breaking RSA. This paper presents aâ€¦ (More)

The first part of this paper classifies all purely cubic function fields over a finite field of characteristic not equal to 3. In the remainder, we describe a method for computing the fundamentalâ€¦ (More)

This paper presents an RSA-like public-key cryptosystem that can only be broken by factoring its modulus. Messages are encoded as units in a purely cubic field, and the encryption exponent is aâ€¦ (More)

We give an explicit treatment of cubic function fields of characteristic at least five. This includes an efficient technique for converting such a field into standard form, formulae for the fieldâ€¦ (More)

We provide a number of results that can be used to derive approximations for the Euler product representation of the zeta function of an arbitrary algebraic function field. Three such approximationsâ€¦ (More)