Implementation of a key exchange protocol using real quadratic fields

From MaRDI portal





[For the entire collection see Zbl 0755.00009.] \textit{J. A. Buchmann} and \textit{H. C. Williams} [Proc. CRYPTO '89, Lect. Notes Comput. Sci. 435, 335-343 (1990; Zbl 0722.68043)] introduced a key exchange protocol which is based on the Diffie-Hellman protocol [\textit{W. Diffie} and \textit{M. E. Hellman} [IEEE Trans. Inf. Theory IT-22, 644-654 (1976; Zbl 0435.94018)]. However, instead of employing arithmetic in the multiplicative group \(F^*\) of a finite field \(F\) (or any finite Abelian group \(G\)), it uses a finite subset of an infinite Abelian group which itself is not a subgroup, namely the set of reduced principal ideals in a real quadratic field. As the authors presented the scheme and its security without analyzing its actual implementation, we will here discuss the algorithms required for implementing the protocol.











This page was built for publication: Implementation of a key exchange protocol using real quadratic fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4036862)