Abstract
To prevent an exhaustive key-search attack of the key-exchange protocol using real quadratic fields, we need to ensure that the number l of reduced principal ideals in K is sufficiently large. In this paper we present an example of a family which are not valid for this protocol.
Subject
Computer Science Applications,General Mathematics
Reference10 articles.
1. "[1] J.A. Buchmann and H.C. Williams, A key exchange system based on imaginary quadratic fields, Journal of Cryptology 1 (1988), 107-118.
2. [2] J.A. Buchmann and H.C. Williams, Quadratic fields and cryptography, In: J.H. Loxton (ed.) Number Theory and Cryptography, Cambridge University Press, Cambridge (1990), 9-25.
3. [3] J.A. Buchmann, R. Scheidler, and H.C. Williams, A key exchange protocol using real quadratic fields, Journal of cryptology 7 (1994), no. 3, 171-199.
4. [4] B.N. Delone and D.K. Faddeev, The Theory of Irrationalities of the Third Degree, Transi. Math. Mono. 10, AMS, Providence, R.I., 1964.
5. [5] W. Diffie and M.E. Hellman, New directions in cryptography, IEEE Trans. Inform. Theory 22 (1976), no. 6, 644-654.