Reputation
15,393
Top tag
Next privilege 20,000 Rep.
Access 'trusted user' tools
Badges
3 44 88
Newest
 Good Answer
Impact
~490k people reached

Nov
14
comment Are there practical upper limits of RSA key lengths?
@jug: But do we need to run the full Miller-Rabin on each candidate, or can we in most cases stop earlier?
Nov
14
revised Are there practical upper limits of RSA key lengths?
fix the calculation
Nov
14
comment Are there practical upper limits of RSA key lengths?
@Thomas: Seems like I wrongly counted the $\log_2 n$ factors in my paragraph to come to this exponent of 4. Correcting now.
Nov
14
answered Are there practical upper limits of RSA key lengths?
Nov
14
revised Are there practical upper limits of RSA key lengths?
formatting, better title, tags
Nov
14
comment Cipher for Product Registration?
Preferably use MAC(secret, username) instead of a simple hash (use HMAC, for example).
Nov
14
revised Why isn't the IND-CCA property inherited when sending redundant ciphertext?
edited tags
Nov
14
revised Measuring entropy for a ciphertext only attack
add tag, slight wording
Nov
13
revised Are these emerging threats against AES affecting your designs?
add paragraph about WPA2-PSK, now removing the comments
Nov
13
revised Are these emerging threats against AES affecting your designs?
formatting
Nov
13
revised Are these emerging threats against AES affecting your designs?
inline the link, identify "We".
Nov
13
revised Getting the encryption method and key from the encrypted data and the raw data
formatting, tag
Nov
13
revised Are these emerging threats against AES affecting your designs?
formatting, spelling
Nov
13
revised For public-key encryption, why does COA resistance imply CPA resistance?
tags + shorter title, see Chat (http://chat.stackexchange.com/transcript/message/2421197#2421197 and following) for discussion
Nov
13
comment For public-key encryption, why does COA resistance imply CPA resistance?
Does "ciphertext-only attack" mean that the attacker doesn't know the public key?
Nov
13
comment For public-key encryption, why does COA resistance imply CPA resistance?
Why does this help? (Please add a bit of clarification to your answer.)
Nov
12
comment What are preimage resistance and collision resistance, and how can the lack thereof be exploited?
@Fixee: I would thought we want the existence (or our knowledge, to go with this paper) of an algorithm which for every $d$ (or at least a large proportion) outputs a fitting $m$, not a separate algorithm for each $d$ (which of course is trivial). I don't see a need for a key here. (Should we move this discussion to chat?)
Nov
12
comment What are preimage resistance and collision resistance, and how can the lack thereof be exploited?
@Fixee: Thanks for the link, I'm reading right now. But this seems to talk mainly about collision resistance, and I think the same problem doesn't apply to preimage resistance (where we don't want preimages for any hash (which is always easy), but for a given one). (But I see that I interpreted your "family of hash functions" wrong.)
Nov
12
revised What is the relation between RSA & Fermat's little theorem?
formatting
Nov
12
revised What is the relation between RSA & Fermat's little theorem?
formatting using MathJax formulas