1. F. BLAKE, X. GAO, R. MULLIN, S. VANSTONE and T. YAGHOOBIAN, “Application of Finite Fields”, Kluwer Academic Publishers.
2. G. BRASSARD, “A note on the complexity of cryptography”, IEEE Tran. Inform. Theory, Vol. IT-25, pp. 232–233, 1979.
3. D. COPPERSMITH and S. WINOGRAD, “Matrix Multiplication via Arithmetic Progressions”, J. Symbolic Computation, 1990, Vol. 9, pp. 251–280.
4. M. GAREY, D. JOHNSON, “Computers and intractability, A Guide to the Theory of N P-Completeness”, FREEMAN.
5. R. LIDL, H. NIEDERREITER, “Finite Fields”, Encyclopedia of Mathematics and its applications, Volume 20, Cambridge University Press.