Proving existence of an encryption scheme that has indistinghuishable multiple encryptions in the presence of an eavesdropper, but is not CPA-secure
64578
How can an encryption scheme be indistinguishable with multiple messages but vulnerable to an adaptive chosen-plaintext attack?
71788
Prove existence of multiplicative inverse modulo p when p is prime
41664
Current mathematics theory used in cryptography/coding theory
137408
Asymmetric format preserving encryption?
105588
Can we use non-adaptive zero-knowledge proof in group signatures
32054
How To Prove That The Rijndael Polynomial Is Irreducible?
146532
Do any one-key-of-many cryptographic schemes exist?
51626
Is a known plaintext, ciphertext, and public-key a viable attack on RSA?
143066
How to secure Elliptic Curve ElGamal encryption against known plaintext attacks?
135593
Decrypting Ciphertext with partial Key Fragment using LFSR and Berlekamp-Massey
114578
Design properties of the Rijndael finite field?
21274
Security strength of RSA in relation with the modulus size
109568
For a given plaintext-ciphertext pair, how many valid AES keys are there?
83963
Proving knowledge of a preimage of a hash without disclosing it?
138517
Is there a cryptography algorithm that will remain safe if P=NP?
41240
Generating a cryptographically secure, many-time use, symmetric encryption key
158213
RSA with probable primes