1. D. Boneh, R.J. Lipton, ‘Algorithms for black-box fields and their application to cryptography’ Proc. Crypto’96, Santa Barbara, Lect. Notes in Comp. Sci., vol 1109, Springer-Verlag, Berlin, 1996, 283–297.
2. E. Brier, C. Clavier, J.-S. Coron and D. Naccache, ‘Cryptanalysis of RSA signatures with fixed-pattern padding’, Proc. Crypto’01, Santa Barbara, Lect. Notes in Comp. Sci., vol. 2139, Springer-Verlag, Berlin, 2001, 433–439.
3. S.D. Chowla and J. Todd, ‘The density of reducible integers’, Canad. J. Math., 1 (1949) 297–299.
4. D. Coppersmith, ‘Fast evaluation of logarithms in fields of characteristic two’, IEEE Trans. Inform. Theory 30 (1984) 587–594.
5. M. Girault and J.-F. Misarsky, ‘Selective forgery of RSA signatures using redundancy’, Proc. Eurocrypt’97, Konstanz, Lect. Notes in Comp. Sci., vol. 1233, Springer-Verlag, Berlin, 1997, 495–507.