1. M. Bardet, J. C. Faugère, and B. Salvy, Complexity of Gröbner Basis Computation for Semi-Regular Overdetermined Sequences over F2 with Solutions in F2, INRIA, rapport de recherche No. 5049 (Decembre 2003).
2. E. R. Canfield, P. Erdös, and C. Pomerance, “On a problem of Oppenheim concerning ‘Factorisatio Numerorum’,” J. Number Theory, 17, 1–28 (1983).
3. M. A. Cherepnev, “On the connection between discrete logarithms and the Diffie–Hellman problem,” Discrete Math., 8, No. 3, 22–30 (1996).
4. H. Cohen, G. Frey et al., Handbook of Elliptic and Hyperelliptic Curve Cryptography, Chapman and Hall, London (2006).
5. Lect. Notes Comput. Sci;JH Davenport,1979