1 |
M. Cipolla, Un metodo per la risoluzione della congruenza di secondo grado, Napoli Rend. 9 (1903), 154-163.
|
2 |
L. M. Adleman, K. Manders, and G. Miller, On taking roots in finite fields, Proceedings of 18th Annual Symposium on Foundations of Computer Science (Providence, R.I., 1977), pp. 175-178. IEEE Comput. Sci., Long Beach, Calif., 1977.
|
3 |
S. J. Agou, M. Deleglise, and J.-L. Nicolas, Short polynomial representations for square roots modulo p, Des. Codes Cryptogr. 28 (2003), no. 1, 33-44.
DOI
|
4 |
P. S. L. M. Barreto and J. F. Voloch, Efficient computation of roots in finite fields, Des. Codes Cryptogr. 39 (2006), no. 2, 275-280.
DOI
|
5 |
D. Coppersmith and I. Shparlinski, On polynomial approximation of the discrete logarithm and the Diffie-Hellman mapping, J. Cryptology 13 (2000), no. 3, 339-360.
DOI
ScienceOn
|
6 |
J. von zur Gathen and J. Gerhard, Modern Computer Algebra, Third Edition, Cambridge University Press, Cambridge, 2013.
|
7 |
E. Kiltz and A. Winterhof, On the interpolation of bivariate polynomials related to the Diffie-Hellman mapping, Bull. Aust. Math. Soc. 69 (2004), no. 2, 305-315.
DOI
|
8 |
T. Lange and A. Winterhof, Polynomial interpolation of the elliptic curve and XTR discrete logarithm, Computing and combinatorics, 137-143, Lecture Notes in Comput. Sci., 2387, Springer, Berlin, 2002.
|
9 |
T. Lange and A. Winterhof, Interpolation of the discrete logarithm in by Boolean functions and by polynomials in several variables modulo a divisor of q−1, Discrete Appl. Math. 128 (2003), no. 1, 193-206.
DOI
ScienceOn
|
10 |
G. L. Mullen and D. White, A polynomial representation for logarithms in GF(q), Acta Arith. 47 (1986), no. 3, 255-261.
DOI
|
11 |
T. Lange and A. Winterhof, Interpolation of the elliptic curve Diffie-Hellman mapping, Applied algebra, algebraic algorithms and error-correcting codes (Toulouse, 2003), 51-60, Lecture Notes in Comput. Sci., 2643, Springer, Berlin, 2003.
|
12 |
D. H. Lehmer, Computer technology applied to the theory of numbers, In William J. Leveque, editor, Studies in number theory, volume 6 of MAA Studies in Mathematics, pages 117-151, Englewood Cliffs, New Jersey, Prentice-Hall, 1969.
|
13 |
R. Lidl and H. Niederreiter, Finite fields, Encyclopedia of Mathematics and its Applications, 20. Addison-Wesley Publishing Company, Advanced Book Program, Reading, MA, 1983.
|
14 |
H. Niederreiter, A short proof for explicit formulas for discrete logarithms in finite fields, Appl. Algebra Engrg. Comm. Comput. 1 (1990), no. 1, 55-57.
DOI
|
15 |
T. Satoh, Closed formulae for the Weil pairing inversion, Finite Fields Appl. 14 (2008), no. 3, 743-765.
DOI
ScienceOn
|
16 |
T. Satoh, On polynomial interpolations related to Verheul homomorphisms, LMS J. Comput. Math. 9 (2006), 135-158.
DOI
|
17 |
T. Satoh, On degrees of polynomial interpolations related to elliptic curve cryptography, Coding and cryptography, 155-163, Lecture Notes in Comput. Sci., 3969, Springer, Berlin, 2006.
|
18 |
T. Satoh, On pairing inversion problems, Pairing-based cryptography-Pairing 2007, 317-328, Lecture Notes in Comput. Sci., 4575, Springer, Berlin, 2007.
|
19 |
R. Schoof, Elliptic curves over finite fields and the computation of square roots mod p, Math. Comp. 44 (1985), no. 170, 483-494.
DOI
|
20 |
A. Winterhof, Polynomial interpolation of the discrete logarithm, Des. Codes Cryptogr. 25 (2002), no. 1, 63-72.
DOI
|
21 |
D. Shanks, Five number-theoretic algorithms, Proceedings of the Second Manitoba Conference on Numerical Mathematics (Univ. Manitoba, Winnipeg, Man., 1972), 51-70. Congressus Numerantium, No. VII, Utilitas Math., Winnipeg, Man., 1973.
|
22 |
Z.-X.Wan, A shorter proof for an explicit formula for discrete logarithms in finite fields, Discrete Math. 308 (2008), no. 21, 4914-4915.
DOI
ScienceOn
|
23 |
A. Tonelli, Bemerkung uber die Auflosung quadratischer Congruenzen, Nachrichten von der Koniglichen Gesellschaft der Wissenschaften und der Georg-Augusts-Universitat zu Gottingen, pp. 344-346, 1891.
|