Reputation
Next tag badge:
384/400 score
80/80 answers
Badges
1 36 82
Impact
~572k people reached

Mar
15
reviewed No Action Needed Encryption with a known plaintext
Mar
14
reviewed Close Implementing modular reductions (n*n)
Mar
14
reviewed Close How do you break encryption on a message?
Mar
13
comment If the text was compressed before using traditional cryptography, how much difficulty increases for frequency analysis attack?
Classical cryptography doesn't use bit strings, instead they use strings from some alphabet (perhaps with 26 characters, maybe more, maybe less). Are you assuming that we modify the compression to work with this alphabet?
Mar
13
reviewed No Action Needed If the text was compressed before using traditional cryptography, how much difficulty increases for frequency analysis attack?
Mar
13
reviewed Approve Of what use is my code for finding prime numbers of a certain size?
Mar
13
reviewed Approve diffusion tag wiki excerpt
Mar
13
comment Why is this a fix to Bleichenbacher's attack?
@Mark: correct; the attacker was using the server as such an Oracle; this change in behavior prevents that.
Mar
13
reviewed No Action Needed Implementing modular reductions (n*n)
Mar
13
reviewed No Action Needed Attack on key exchange with authentication
Mar
13
comment Why is this a fix to Bleichenbacher's attack?
That is correct
Mar
13
reviewed No Action Needed Beginner question about secure communication with one user using DES
Mar
13
reviewed Close Of what use is my code for finding prime numbers of a certain size?
Mar
13
answered Why is this a fix to Bleichenbacher's attack?
Mar
13
awarded  Nice Answer
Mar
12
comment Is this discrete log generalization a well known cryptographic assumption?
@RandomGuy: if group order is prime, then it is always cyclic. Otherwise, you have a good point: that would mean that I would need to omit the 'perhaps we can handle it if the group order is composite' statement at the end, or at least, qualify it.
Mar
12
answered Is this discrete log generalization a well known cryptographic assumption?
Mar
11
comment Encrypt-then-MAC: Do I need to authenticate the IV?
Correction: assuming we're talking about CBC mode, Mallory can predict the result of the modification; if he flips bit $i$ of the IV, this will result in flipping bit $i$ of the decrypted text. What this means is that if Mallory knows the first 128 bits of the correct decrypted message, he can replace that with any other 128 bit value of his choosing.
Mar
11
reviewed No Action Needed Algorithm: How to use x and y mouse movement co-ordinates to generate random data?
Mar
10
reviewed Close Decrypting DES with decrypted and encrypted data