1. L. M. Adleman and K. S. McCurley,“Open problems in number theoretic complexity, II” proceedings of ANTS-I, LNCS 877, (1994), pp.291–322.
2. G. R. Blakley and I. Borosh, “Rivest-Shamir-Adleman public key cryptosystems do not always conceal messages,” Comput. & Maths. with Appls., 5, (1979), pp.169–178.
3. D. Coppersmith, M. Franklin, J. Patarin and M. Reiter, “Low-exponent RSA with related messages,” Advances in Cryptology — EUROCRYPT '96, LNCS 1070, (1996), pp.1–9.
4. D. Coppersmith, “Finding a small root of a univariate modular equation,” Advances in Cryptology — EUROCRYPT '96, LNCS 1070, (1996), pp.155–165.
5. J. Cowie, B. Dodson, R. Elkenbracht-Huizing, A. K. Lenstra, P. L. Montgomery, J. Zayer; “A world wide number field sieve factoring record: on to 512 bits,” Advances in Cryptology — ASIACRYPT '96, LNCS 1163, (1996), pp.382–394.