Pages that link to "Item:Q2739462"
From MaRDI portal
The following pages link to On probable prime testing and the computation of square roots mod \(n\) (Q2739462):
Displaying 9 items.
- Correcting noisy exponentiation black-boxes modulo a prime (Q396612) (← links)
- Strong pseudoprimes to base 2 (Q2097530) (← links)
- An unconditional improvement to the running time of the quadratic Frobenius test (Q2291718) (← links)
- On taking square roots without quadratic nonresidues over finite fields (Q3015058) (← links)
- Improved error bounds for the Fermat primality test on random inputs (Q3177720) (← links)
- Fermat test with Gaussian base and Gaussian pseudoprimes (Q3466197) (← links)
- (Q3786518) (← links)
- A simple and fast probabilistic algorithm for computing square roots modulo a prime number (Corresp.) (Q3806810) (← links)
- Notes on some new kinds of pseudoprimes (Q5713239) (← links)