Stack Exchange
sign up
|
log in
|
Cryptography
beta
Questions
Tags
Tour
Users
Ask Question
D.W.
less info
meta user
|
network profile
8,034
reputation
8
27
bio
website
location
age
visits
member for
1 year, 9 months
seen
2 hours ago
stats
profile views
137
8,034
reputation
bio
website
visits
member for
1 year, 9 months
8
27
badges
location
seen
2 hours ago
summary
answers
questions
tags
badges
favorites
bounties
reputation
activity
242
Answers
newest
activity
votes
2
Pseudorandom generator and AE-secure encryption
4
Should we sign-then-encrypt, or encrypt-then-sign?
4
How to construct a good PRF from a block cipher?
5
Is storing the hash of a key together with ciphertext encrypted with that key secure?
2
Proof that a function constructed from a PRP is, or is not a PRF?
1
Is there an authenticated encryption scheme where the recipient can attribute the message to a single sender?
3
Will varying plaintext compensate for a fixed initialisation vector?
5
Is there an authenticated encryption scheme where the recipient can attribute the message to a single sender?
2
Proof that a function constructed from a PRP is, or is not a PRF?
3
Is Wiener's attack on RSA extendable to larger keys with low hamming weight?
1
Secure MAC implies that probability of same tags on different messages is negligible
2
Word-based stream ciphers vs “regular” stream ciphers?
2
How do unkeyed hash functions (for MDCs) provide security?
3
Which risks are associated with deriving multiple keys from the same DH secret Z?
2
How to prove that the concatenation of two secure PRG is secure?
0
Fiat-Shamir signature
1
What is a trapdoor permutation?
2
Cryptanalysis of Linear Feedback Shift Registers
1
Blowfish: hex digits of pi used for s-boxes?
0
ECM Implementation is really slow
1
Why does HOTP use such a complex truncate function?
2
RSA and prime difference
2
CPA Secure Chosen plaintext scheme
1
Real world use cases of Multi Party Computation
2
Counter mode secure hash algorithm
0
Modifications of CBC-MAC
0
Messages of different lengths and one-time computationally-secret
0
Why is an Encrypt-and-MAC scheme with deterministic MAC not IND-CPA secure?
2
Is an RSA variant with public exponent $e=f+(p-1)\cdot(q-1)$ safe (for $f$ random in some small interval)?
1
How can I prove in zero knowldege that an ElGamal shuffle is correct for a special setting?
Cryptography Stack Exchange works best with JavaScript enabled