ISSN:
1432-1378
Keywords:
Key exchange
;
Discrete logarithm
;
Real quadratic field
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
Notes:
Abstract 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 (see [8]). Since then, this scheme has been extended to numerous other finite groups. Recently, Buchmann and Williams [2] introduced a version of the Diffie-Hellman protocol which uses the infrastructure of a real quadratic field. Theirs is the first such system not to require an underlying group structure, but rather a structure which is “almost” like that of a group. We give here a more detailed description of this scheme as well as state the required algorithms and considerations for their implementation.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF02318548
Permalink
