Reputation
10,268
Next tag badge:
77/100 score
15/20 answers
Badges
3 13 46
Newest
 Nice Answer
Impact
~159k people reached

2h
comment What are the constraints on using GCM with a tag size of 96 and 128 bits
This is the kind of spam I'm looking for, although I haven't extracted the answer yet :)
16h
comment Is there really any way to nullify or avoid MITM attacks?
@VTCAKAVSMoACE No, a trust system needs to be in place. But a MITM can still succeed if the protocol and algorithms are chosen poorly.
22h
comment Is there really any way to nullify or avoid MITM attacks?
You may want to take a look at the PGP model of trust (i.e. web of trust).
22h
comment In HMAC-MD5 Implementation, why “i_key_pad” and “o_key_pad” if They Are Public and Constant?
I hope you don't mind that we closed this as a dupe (it's kind of providing a link). If you think there are things from the answer that you don't understand then please comment here.
23h
comment Can a block cipher encrypt the message to itself (plaintext equal to ciphertext)
I did by incidence voted to close as a dupe for the first question, but I do agree that the link "This question" in the comment from Otus is more to the point. Besides that, I like the accepted answer better as well.
1d
comment Is it okay to include relative time for true random number generation?
Mouse movements and key strokes may not happen at all, e.g. on headless servers. Precise network timings probably always happen, but are slightly dangerous as they may be influenced by outside parties. That's why a TRNG is for me a prime requirement for CPU's, if only to use it as additional seed. A boot at least always happens...
1d
comment How to break this PRNG encryption scheme?
I think the description is a bit off - although still understandable (assigning to a function and such). I guess that for a 64 bit state you should be able to find cycles. Otherwise it looks like a micro form of CBC to me :)
1d
comment Using same modulus for RSA
Why would the attacker know $r_1$ and $r_2$ by the way? Why not use a known padding scheme such as RSAES-OAEP or RSAES-PKCS1-v1_5 that already includes a random value?
1d
comment Using same modulus for RSA
I think the main issue is that the issue in the first link (knowledge of $d_i$ leading to factoring any other $d$) still exists, with or without specific padding. So it doesn't make much sense to have different key pairs with the same modulus if the private key isn't kept private.
1d
comment Where is CFB-MAC defined?
Hmm, I wonder if it has the same issues as CBC-MAC...
Aug
28
revised Why do we truncate the hash when using DSA?
edited body
Aug
28
revised Size of encrypted AES CEK in CMS block
deleted 185 characters in body
Aug
28
comment Are there ANY text strings that will generate the same SHA-512 Hash output?
Added a paragraph about slowly finding a hash collision instead of "quickly*
Aug
28
revised Are there ANY text strings that will generate the same SHA-512 Hash output?
added 432 characters in body
Aug
28
comment Are there ANY text strings that will generate the same SHA-512 Hash output?
@D.W. It must be said that those questions would be hard to link to each other if you're not a cryptographer. Then again, maybe we don't want this question for every hash algorithm... We could rework this question somewhat to mean every possible SHA-2 hash maybe. That would at least take care of the most common 4 (+ 2).
Aug
27
comment RSA - PKCS#1 padding - overall correction of algorithm
@SEJPM Could you please convert the comments into an answer?
Aug
27
comment CPA-security proof of “l-padded RSA” encryption scheme
I think you rather well answered your own question, @pa5h1nh0. However this may not be the place for followup questions. If you're stuck, try again, and if that doesn't work, ask a new question please.
Aug
27
comment Size of encrypted AES CEK in CMS block
Could you show the entire output at the bottom of your question? Or otherwise by a comment containing a link to the structure as input in the online ASN.1 decoder? There should be some information structure containing the algorithm that was used.
Aug
27
comment Why do we truncate the hash when using DSA?
Thanks for the update PicPuc. I should remember to use \bmod instead of \mod!
Aug
27
comment Having plaintext and ciphertext, how can I learn more about key/encryption?
I've got the inkling of a feeling that wlraider requires a top modern encryption technique here. I don't think this was a request for a generic education on cryptography - and if it was, it would be off topic.