Pages that link to "Item:Q1269754"
From MaRDI portal
The following pages link to Efficient algorithms for computing the Jacobi symbol (Q1269754):
Displaying 10 items.
- On the worst case of three algorithms for computing the Jacobi symbol (Q752075) (← links)
- A randomized sublinear time parallel GCD algorithm for the EREW PRAM (Q991752) (← links)
- Secure sealed-bid online auctions using discreet cryptographic proofs (Q2450498) (← links)
- Efficient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integers (Q2456564) (← links)
- Modular exponentiation via the explicit Chinese remainder theorem (Q3420440) (← links)
- On the Validity of the Φ-Hiding Assumption in Cryptographic Protocols (Q3600384) (← links)
- (Q4375616) (← links)
- Computing Jacobi Symbols modulo Sparse Integers and Polynomials and Some Applications (Q4500854) (← links)
- An O(M(n) logn) Algorithm for the Jacobi Symbol (Q4931642) (← links)
- Improvements on non-interactive zero-knowledge proof systems related to quadratic residuosity languages (Q6125215) (← links)
