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

131 Factoring polynomials over large finite fields – Elwyn R Berlekamp - 1970
30 On taking Roots in Finite Field – L M Adleman, K Manders, G Miller
51 Factoring Integers With The Number Field Sieve – J P Buhler, H W Lenstra, C Pomerance - 1993
27 Five number theoretic algorithms – D Shanks - 1972
12 Computer technology applied to the theory of numbers – Derrick H Lehmer - 1969
13 Bemerkung über die Auflösung quadratischer Congruenzen. Nachrichten der Akademie der – Alberto Tonelli
6 Un metodo per la risoluzione della congruenza di secondo grado. Rendiconto dell’Accademia delle Scienze Fisiche e Matematiche – Michele Cipolla - 1903
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
181 Riemann’s hypothesis and tests for primality – G Miller - 1976
64 Schnelle Multiplikation großer Zahlen – A Schönhage, V Strassen - 1971
592 The Art of Computer Programming, Volume 2: Seminumerical Algorithms (3rd Edition – Donald Knuth - 1997
64 Elliptic curves: Number theory and cryptography – Lawrence C Washington - 2008
154 Elliptic curves over finite fields and the computation of square roots mod p – René Schoof - 1985
26 Faster Integer Multiplication – Martin Fürer - 2007
67 zur Gathen and Jürgen Gerhard. Modern computer algebra – Joachim von - 2003
26 The least quadratic non residue – Nesmith C Ankeny - 1952
73 Probabilistic Algorithms In Finite Fields – Michael O. Rabin, Michael O. Rabin - 1979
759 A course in computational algebraic number theory, volume 138 of Graduate Texts in Mathematics – Henri Cohen - 1993