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

156 Factoring polynomials over large finite fields – E R Berlekamp - 1970
36 On taking roots in finite fields – L M Adleman, K Manders, G Miller - 1977
61 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
37 Five number-theoretic algorithms – D Shanks - 1972
8 Un metodo per la risoluzione della congruenza di secondo – Michele Cipolla - 1903
171 Elliptic curves over finite fields and the computation of square roots mod p – René Schoof - 1985
676 The Art of Computer Programming, Volume 2/Seminumerical Algorithms – D E Knuth - 1968
106 Elliptic curves: number theory and cryptography – L C Washington - 2003
207 Riemann’s hypothesis and tests for primality – Gary L Miller - 1976
80 Schnelle Multiplikation großer Zahlen – A Schönhage, V Strassen - 1971
101 zur Gathen and Jürgen Gerhard. Modern Computer Algebra – Joachim von - 2003
41 Faster Integer Multiplication – Martin Fürer - 2007
29 The least quadratic non residue – N C Ankeny - 1952
81 Probabilistic Algorithms In Finite Fields – Michael O. Rabin, Michael O. Rabin - 1979
918 A Course in Computational Algebraic Number Theory, Graduate Texts – H Cohen - 1993