Constructing nonresidues in finite fields and the extended Riemann hypothesis (1991)

Cached

Download Links

by Johannes Buchmann , Victor Shoup
Venue:Math. Comp
Citations:8 - 0 self

Documents Related by Co-Citation

153 Factoring polynomials over large finite fields – E Berlekamp - 1970
36 On taking roots in finite fields – L M Adleman, K Manders, G Miller - 1977
60 Factoring Integers With The Number Field Sieve – J P Buhler, H W Lenstra, C Pomerance - 1993
5 Édouard Lucas and Primality Testing, volume 22 – Hugh C Williams - 1998
3 and José Felipe Voloch. Efficient computation of roots in finite fields – Paulo S Barreto
21 Computer technology applied to the theory of numbers – D H Lehmer - 1969
19 Bemerkung über die Auflösung quadratischer Congrenzen, Göttinger Nachrichten – A Tonelli - 1891
674 The Art of Computer Programming, Volume 2: Seminumerical Algorithms, Addison-Wesley, third edition – D Knuth - 1997
106 Elliptic curves: Number theory and cryptography. Discrete Mathematics and its Applications – L Washington - 2003
205 Riemann’s hypothesis and tests for primality – G L Miller
170 Elliptic curves over finite fields and the computation of square roots mod p – R Schoof - 1985
37 Five numbertheoretic algorithms – D Shanks - 1972
79 Schnelle Multiplikation großer Zahlen – A Schönhage, V Strassen - 1971
97 zur Gathen and Jürgen Gerhard. Modern Computer Algebra – Joachim von - 1999
41 Faster Integer Multiplication – Martin Fürer - 2007
8 Un metodo per la risoluzione della congruenza di secondo – M Cipolla - 1903
29 The least quadratic non residue – N Ankeny - 1952
81 Probabilistic Algorithms In Finite Fields – Michael O. Rabin, Michael O. Rabin - 1979
907 A Course in Computational Algebraic Number Theory, volume 138 of Graduate Texts in Math.Springer-Verlag – H Cohen - 1993