1. W. Alexi, B. Chor, O. Goldreich, C. P. Schnorr; “Rsa and Rabin functions: certain parts are as hard as the whole,” SIAM Journal of Computing, 17, (1988), pp.194–209.
2. G. R. Blakley and I. Borosh, “Rivest-Shamir-Adelman 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. N. Demytko, “A new elliptic curves based analogue of RSA,” Advances in Cryptology — EUROCRYPT '93, LNCS 765, (1994), pp.40–49.