Designs, Codes and Cryptography

, Volume 7, Issue 1, pp 153–174

Key-exchange in real quadratic congruence function fields

  • R. Scheidler
  • A. Stein
  • Hugh C. Williams

DOI: 10.1007/BF00125081

Cite this article as:
Scheidler, R., Stein, A. & Williams, H.C. Des Codes Crypt (1996) 7: 153. doi:10.1007/BF00125081


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 1976, but instead of making use of a group for its underlying structure, makes use of a structure which is “almost” a group. The method is an extension of the recent ideas of Scheidler, Buchmann and Williams, but, because it is implemented in these function fields, several of the difficulties with their protocol can be eliminated. A detailed description of the protocol is provided, together with a discussion of the algorithms needed to effect it.

Copyright information

© Kluwer Academic Publishers 1996

Authors and Affiliations

  • R. Scheidler
    • 1
  • A. Stein
    • 2
  • Hugh C. Williams
    • 3
  1. 1.Department of Mathematical SciencesUniversity of DelawareNewarkUSA
  2. 2.FB-9 Mathematik, Universität des SaarlandesSaarbrückenGermany
  3. 3.Department of Computer ScienceUniversity of ManitobaWinnipegCanada