Efficient algorithms for computing the Jacobi symbol

DOI10.1006/jsco.1998.0226zbMath0919.68075OpenAlexW2062262765MaRDI QIDQ1269754

Shawna Meyer Eikenberry, Jonathan P. Sorenson

Publication date: 23 August 1999

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jsco.1998.0226

zbMATH Keywords

Jacobi symbol

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Parallel algorithms in computer science (68W10) Power residues, reciprocity (11A15)

Related Items (6)

Improvements on non-interactive zero-knowledge proof systems related to quadratic residuosity languages ⋮ Secure sealed-bid online auctions using discreet cryptographic proofs ⋮ Efficient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integers ⋮ On the Validity of the Φ-Hiding Assumption in Cryptographic Protocols ⋮ A randomized sublinear time parallel GCD algorithm for the EREW PRAM ⋮ Modular exponentiation via the explicit Chinese remainder theorem

This page was built for publication: Efficient algorithms for computing the Jacobi symbol