« first day (3571 days earlier)      last day (24 days later) » 

4:42 AM
Q: Hash of a ciphertext

TheoWould hashing a ciphertext (so $H(Enc(pk,m))$) compromise it in any way if both schemes are secure by themselves? This doesn't seem to be the case but I couldn't find a definitive answer.

4 hours later…
8:45 AM
I have added an alternative side-bar suggestion
A: Do we want to update our "Ask Question" side-bar and if so, how?

SEJPMI agree with the more exhaustive proposal initiated by kelalaka that a bulleted list might be helpful. However, I think we should keep it contained to the most common issues we encounter and leave the exhaustiveness to our Help Center. So instead my below suggestion focuses on our four close reas...

Though I kinda fear it might be a bit long
1 hour later…
9:48 AM
@SEJPM yes, It should be as short as possible, IMHO
2 hours later…
11:54 AM
Update: Found it. It was at the bottom of that doc.
5 hours later…
5:22 PM
Hello. I attempted to fix the issues with the last protocol design and am look for more on feedback on possible weaknesses or improvements. gist.github.com/jbis9051/e045db43979d171b3128894a924115db
cc @MaartenBodewes
2 hours later…
7:27 PM
Should I write a similar answer like this stackoverflow.com/a/65833999/1820553 to this crypto.stackexchange.com/q/89560/18298 so that we have a canonical Q
7:51 PM
Ok, I went further to write one, act according to future agreement.
8:06 PM
Seems on topic here, so sure.
Probably more on topic on crypto than on SO.
8:41 PM
Q: Can SHA256 hash be considered as a secure key proof?

CryptoCrypto224I want to use PBKDF2 with 1,000,000 iterations (I don't know yet exactly how many I will choose) to derive a 256-bit symmetric key K from a password provided by a user (at least 40 bits of entropy). Then I would like to have a proof that the user has/knows the key K. The key will be hashed once w...


« first day (3571 days earlier)      last day (24 days later) »