Proving an encrypted message contains (but does not 100% consist of) a plain-text message?
128850
Proving an encrypted message contains (but does not 100% consist of) a plain-text message?
67059
Can we decrypt in this order when the message is encrypted twice?
15614
Why does the padding in Merkle–Damgård hash functions like MD5 contain the message length?
37467
With sufficient randomness, is XOR an acceptable mechanism for encrypting?
40198
Is it better to encrypt a message and then compress it or the other way around? Which provides more security?
60340
PGP encrypt single message for multiple recipients
68195
Is there a standard for public key encrypting and signing short messages?
6321
How can I do a brute force (ciphertext only) attack on an CBC-encrypted message?
61602
Binary strings (words) proof
12035
XOR cipher with fixed key and known relation among plaintexts
107738
Decrypt all RSA ciphertexts if you can break 1% of them
105871
Length of message in RSA and splitting of long messages
43972
/etc/shadow encryption method
84835
Can a computationally unbounded adversary break any public-key encryption scheme?
113308
Building a combined encryption scheme from two encryption schemes that's secure if at least on of them is secure
128785
How can uniformity of hash functions (e.g. SHA-256) be proved?
145696
Is there a way to find $a$ and $b$ keywords in an affine cipher when only ciphertext but no plaintext is known?