The following pages link to (Q3726186):
Displaying 11 items.
- Constant-round perfect zero-knowledge computationally convincing protocols (Q808240) (← links)
- The generation of random numbers that are probably prime (Q1118632) (← links)
- Local randomness in pseudorandom sequences (Q1180515) (← links)
- Was ist zero-knowledge? (Q1312706) (← links)
- Fast generation of prime numbers and secure public-key cryptographic parameters. (Q1895963) (← links)
- General secret sharing based on the Chinese remainder theorem with applications in e-voting (Q2866729) (← links)
- Large primes in stream cipher cryptography (Q3972878) (← links)
- (Q4011774) (← links)
- (Q4674276) (← links)
- A server-aided computation protocol for rsa enciphering algorithm (Q4844577) (← links)
- Polynomial algorithms for primality testing in algebraic number fieldswith class number 1 (Q6656650) (← links)