The following pages link to (Q4314050):
Displaying 21 items.
- Optimal strong primes (Q834990) (← links)
- An extended quadratic Frobenius primality test with average- and worst-case error estimate (Q862420) (← links)
- Efficient polynomial time algorithms computing industrial-strength primitive roots (Q1045890) (← links)
- The generation of random numbers that are probably prime (Q1118632) (← links)
- Recent developments in primality testing (Q1160213) (← links)
- Some algorithms for generation of large prime numbers (Q1276025) (← links)
- Primality testing with fewer random bits (Q1321031) (← links)
- Fast generation of prime numbers and secure public-key cryptographic parameters. (Q1895963) (← links)
- An intelligent choice of witnesses in the Miller-Rabin primality test. Reinforcement learning approach (Q2700038) (← links)
- Algorithms for generating, testing and proving primes: A survey (Q2708615) (← links)
- Generating strong primes in RSA cryptosystems (Q2719640) (← links)
- Algorithms for relatively cyclotomic primes (Q2843822) (← links)
- Generating safe primes (Q2873165) (← links)
- Recognizing primes (Q3505774) (← links)
- Some negative results concerning prime number generators (Q3717107) (← links)
- Strong Primes are Easy to Find (Q3728811) (← links)
- Infinite Sets of Primes with Fast Primality Tests and Quick Generation of Large Primes (Q3828063) (← links)
- Fast generation of provable primes using search in arithmetic progressions (Q4940703) (← links)
- Information Security Practice and Experience (Q5316513) (← links)
- Public Key Cryptography - PKC 2005 (Q5711574) (← links)
- Fundamentals of Computation Theory (Q5900791) (← links)
