On the worst case of three algorithms for computing the Jacobi symbol
From MaRDI portal
Publication:752075
DOI10.1016/S0747-7171(08)80160-5zbMath0715.11072MaRDI QIDQ752075
Publication date: 1990
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
11Y16: Number-theoretic algorithms; complexity
11A15: Power residues, reciprocity
Related Items
Comments on search procedures for primitive roots, Computations of class numbers of real quadratic fields, Dynamical analysis of a class of Euclidean algorithms.
Cites Work
- Über die Schrittanzahl beim Algorithmus von Harris und dem nach nächsten Ganzen
- Computational problems associated with Racah algebra
- Fast computation of continued fraction expansions.
- A modification of the RSA public-key encryption procedure (Corresp.)
- The Jacobi symbol algorithm
- On a theorem of Heilbronn
- Erratum: A Fast Monte-Carlo Test for Primality
- Über die mittlere Schrittanzahl bei Divisionsalgorithmen
- Prime numbers and computer methods for factorization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item