1. I. Biehl and J. Buchmann, “An analysis of the reduction algorithms for binary quadratic forms”, Technical Report No. TI-26/97, Technische Universität Darmstadt, (1997).
2. M. Ben-Or, S. Goldwasser and A. Wigderson, “Completeness theorems for non-cryptographic fault tolerant distributed computation”, STOC, (1988), pp. 1–10.
3. Lect Notes Comput Sci;D. Boneh,1997
4. Lect Notes Comput Sci;D. Boneh,1998
5. J. Buchmann and H. C. Williams, “A key-exchange system based on imaginary quadratic fields”, Journal of Cryptology, 1, (1988), Springer, pp. 107–118.