133 reputation
5
bio website
location
age
visits member for 1 year, 4 months
seen Aug 21 '13 at 20:09

Jun
4
awarded  Popular Question
Aug
21
accepted Understanding the “cube-root math” behind an RSA signature forgery
Aug
21
comment Understanding the “cube-root math” behind an RSA signature forgery
I'm sorry, is there a way I can re-phrase anything so it's clearer? I'm trying to adapt the math to a modulus of a different length and want to understand the generalization for how the cube root is computed. Either I'm missing something (likely) or it's not in the realm of the paper...
Aug
21
comment Understanding the “cube-root math” behind an RSA signature forgery
It's still not clear to me; don't I need the $2^{34}$ value to compute (7) and (8) at all?
Aug
21
asked Understanding the “cube-root math” behind an RSA signature forgery
Jun
26
awarded  Scholar
Jun
26
accepted Finding a keylength in a repeating key XOR cipher
Jun
26
comment Finding a keylength in a repeating key XOR cipher
I corrected that! I upvoted both D.W.'s answer and your answer because they explained the text I was looking at, but I'm marking yours as 'correct' because your bit about comparing adjacent blocks of the cyphertext is what helped me solve the problem I was working on. Thanks to all!
Jun
26
awarded  Editor
Jun
26
revised Finding a keylength in a repeating key XOR cipher
added 21 characters in body
Jun
25
awarded  Student
Jun
25
comment Finding a keylength in a repeating key XOR cipher
Thanks for the explanation. Your last paragraph nails what I'm trying to figure out with this post: to break this type of cipher, I'd need to compare (via hamming distance) adjacent N-length blocks of the ciphertext? So the hypothetical example in my post shows the right idea with how to compare the cipher against itself, and I've understood what the passage meant to convey?
Jun
25
awarded  Supporter
Jun
24
asked Finding a keylength in a repeating key XOR cipher