共 13 条
- [1] Atkin A. O. L.(1993)Elliptic curves and primality proving Math. Comp. 61 29-68
- [2] Morain F.(1999)Note on taking square-roots modulo N IEEE Trans. Inf. Theory 45 807-809
- [3] Bach E.(1970)Factoring polynomials over large finite fields Math. Comp. 24 713-735
- [4] Huber K.(1903)Un metodo per la risolutione della congruenza di secondo grado Rendiconto dell'Accademia Scienze Fisiche e Matematiche, Napoli, Ser. 3 IX 154-163
- [5] Berlekamp E. R.(1995)Factors of generalized fermat numbers Math. Comp. 64 397-405
- [6] Cipolla M.(1998)A survey of fast exponentiation methods Journal of Algorithms 27 129-146
- [7] Dubner H.(1999)An analysis of Shanks's algorithm for computing square roots in finite fields CRM Proceedings and Lecture Notes 19 231-242
- [8] Keller W.(1980)Probabilistic algorithms in finite fields SIAM J. Comput. 9 273-280
- [9] Gordon D.(1988)Fast evaluation of Dickson Polynomials Contrib. to General Algebra 6 223-225
- [10] Lindhurst S.(1985)Elliptic curves over finite fields and the computation of square roots mod Math. Comp. 44 483-494