The following pages link to Generating safe primes (Q2873165):
Displaying 5 items.
- Connectedness of digraphs from quadratic polynomials (Q2309725) (← links)
- Non-malleable time-lock puzzles and applications (Q2697901) (← links)
- Simple verifiable delay functions (Q5090439) (← links)
- On equations \((-1)^\alpha p^x+ (-1)^\beta (2^k(2p + 1))^y= z^2\) with Sophie Germain prime \(p\) (Q6596274) (← links)
- Trapdoor memory-hard functions (Q6637334) (← links)