If $\mathrm{P}=\mathrm{NP}$ were efficiently solvable, how would Internet security work?
40397
P = NP and current cryptographic systems
90079
Theoretical pi-based stream cipher
26462
What's the fundamental difference between Diffie-Hellman and RSA?
51465
New, elegant proofs for $\varphi(p^{k})=p^{k}-p^{k-1}$
70064
Computational complexity of RSA
40158
Why is $H(k\mathbin\Vert x)$ not a secure MAC construction?
43477
Choosing between additive or multiplicative group for Diffie-Hellman
87460
What is the relation between computational security and provable security?
120627
Reducibility of polynomials modulo p
152231
Computing the product of p/(p - 2) over the odd primes
66789
Coefficients in Shamir's Secret Sharing Scheme
157652
Fermat's Last Theorem for Gaussian Integers (excluding the integers or  same pure imaginaries)
126908
Is it possible for an encryption method to exist which is impossible to crack, even using quantum computers?
127246
How to prove the security of the PRNG?
14827
RSA: Fast factorization of N if d and e are known
130244
Exercise similar to prime avoidance theorem in R.Y. Sharp's textbook
85354
What's "P=NP?", and why is it such a famous question?