Algorithms in Number Theory

This publication has 38 references indexed in Scilit:

• Factoring with cyclotomic polynomials
  Mathematics of Computation, 1989
• Parallel implementation of the quadratic sieve
  The Journal of Supercomputing, 1988
• Recognizing primes in random polynomial time
  Published by Association for Computing Machinery (ACM) ,1987
• Computing in the Jacobian of a hyperelliptic curve
  Mathematics of Computation, 1987
• Implementation of a new primality test
  Mathematics of Computation, 1987
• Sequences of numbers generated by addition in formal groups and new primality and factorization tests
  Advances in Applied Mathematics, 1986
• Fast evaluation of logarithms in fields of characteristic two
  IEEE Transactions on Information Theory, 1984
• Primality testing and Jacobi sums
  Mathematics of Computation, 1984
• On a problem of Oppenheim concerning “factorisatio numerorum”
  Journal of Number Theory, 1983
• On Distinguishing Prime Numbers from Composite Numbers
  Annals of Mathematics, 1983