Stack Exchange
sign up
|
log in
|
Cryptography
beta
Questions
Tags
Tour
Users
Ask Question
Henrick Hellström
less info
meta user
|
network profile
2,646
reputation
1
4
12
bio
website
location
age
visits
member for
1 year, 3 months
seen
11 mins ago
stats
profile views
29
2,646
reputation
bio
website
visits
member for
1 year, 3 months
1
4
12
badges
location
seen
11 mins ago
summary
answers
questions
tags
badges
favorites
bounties
reputation
activity
74
Posts
suggestions
reviews
revisions
comments
badges
posts
accepts
all
2h
answered
Proper Way to Encrypt Data with Two Keys?
May
20
answered
Is Wikipedia's table about SHA-2 collisions correct?
May
16
answered
Generate fixed length cipher text from arbitrary length plaintext
May
13
answered
Is there a way to do fair exchange between two parties who don't trust each other?
May
9
answered
Does knowledge of original file size provide a cryptographic weakness?
May
7
answered
What does $(\mathbb{Z}_n^*)^2$ mean?
May
5
answered
how much is secure to encrypt a password using itself (as encryption key) for storing it on a unsecure media?
May
5
answered
Implementing secret reconstruction in Shamir's Secret Sharing
May
4
answered
Is AES really used for Top Secret stuff?
May
3
answered
encrypt message with one digest 0-9 instead of 01-26
May
2
answered
Knowing a valid salted hash for an unknown secret, is it possible to compute another valid hash?
Apr
23
answered
Using the same secret key for encryption and authentication in a Encrypt-then-MAC scheme
Apr
22
answered
Is it possible to work out the hash algorithm from a list of known message-hash pairs?
Apr
4
answered
DSA signatures with related k and unknown payloads
Apr
4
answered
Attack on DSA with signatures made with k, k+1, k+2
Mar
31
answered
What's the difference between Trapdoor Functions and Encryption Functions?
Mar
31
asked
Predicate Encryption supporting disjunctions
Mar
28
answered
What does the expression $1^n$ mean as a function argument?
Mar
27
answered
Potential vulnerability in DH key selection - am I understanding this right?
Mar
25
asked
Solving hard problems in $\mathbb Z_{p}^{*}$ when $\mathbb p$ is close to $\mathbb 2^{n}$
Cryptography Stack Exchange works best with JavaScript enabled