The following pages link to (Q3973160):
Displaying 10 items.
- A simple approach for generating RSA keys (Q287121) (← links)
- Constant-round perfect zero-knowledge computationally convincing protocols (Q808240) (← links)
- On RSA moduli with almost half of the bits prescribed (Q1003703) (← links)
- On using primes for public key encryption systems (Q1109750) (← links)
- Fast generation of prime numbers and secure public-key cryptographic parameters. (Q1895963) (← links)
- On RSA moduli with prescribed bit patterns (Q2491291) (← links)
- Efficient method for generating strong primes with constraint of bit length (Q3363234) (← 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)
- Advances in Cryptology - ASIACRYPT 2003 (Q5902387) (← links)