26,078 reputation
11847
bio website
location
age
visits member for 2 years, 8 months
seen 1 hour ago

Oct
1
reviewed Approve suggested edit on voip tag wiki excerpt
Oct
1
reviewed Approve suggested edit on attack tag wiki
Oct
1
reviewed Approve suggested edit on ind-cca tag wiki excerpt
Sep
30
revised Who's talking to who encryption - does this concept work?
edited tags
Sep
30
reviewed Approve suggested edit on Non-interactive proof that an element is in a subgroup
Sep
27
comment What makes RSA secure by using prime numbers?
Minor nit: it's not true that $e, d$ must meet (satisfy) the equation $ed \equiv 1 (\bmod \phi(n))$. One counterexample is $n=133$, $e=5$, $d=11$. That has $ed \equiv 55\ (\bmod \phi(n) = 108)$, however ${(m^e)}^d \equiv m\ (\bmod\ n)$ for all $m$. This is a minor point, however we should avoid telling beginners things which aren't true.
Sep
26
reviewed Edit suggested edit on meet-in-the-middle-attack tag wiki excerpt
Sep
26
revised meet-in-the-middle-attack wiki excerpt
Rewrote description to include more detail.
Sep
26
reviewed Edit suggested edit on meet-in-the-middle-attack tag wiki
Sep
26
revised meet-in-the-middle-attack wiki description
Rewrote description to include more detail.
Sep
26
reviewed Approve suggested edit on Provable Encryption
Sep
25
revised Algorithm for sharing secret information with redundant keys
edited tags
Sep
25
reviewed Edit suggested edit on meet-in-the-middle-attack tag wiki excerpt
Sep
25
revised meet-in-the-middle-attack wiki excerpt
edited body
Sep
25
reviewed Edit suggested edit on meet-in-the-middle-attack tag wiki
Sep
25
revised meet-in-the-middle-attack wiki description
The time reduction is not "expoential"; MitM can also be employed against some asymmetric scenarios (e.g. it's the big-step-little-step method of doing DLog)
Sep
24
comment RSA Decryption with Private Key but no public exponent
@owlstead: I'm sorry if I implied that blinding or protection from DFA was OpenSSL specific; those are generic reasons why you might need the public exponent to perform the RSA private operation.
Sep
24
answered RSA Decryption with Private Key but no public exponent
Sep
23
comment Where is the S-Box generated in Rijandel/AES?
@AlexandreYamajako: see iacr.org/archive/ches2009/57470001/57470001.pdf for a fast constant time implementation of AES. Yes, their trick won't work for CBC mode; it works just fine for GCM.
Sep
20
comment How can we determine if two discrete logarithms are equal?
@Alex: it occurs to me that there are two different meanings of DDH: "is there distinguisher that gives nontrivial advantage in determining whether $g^{ab} = g^c$", and "is there an error-free test that determines whether $g^{ab} = g^c$. The former is actually more common (and may be considered the "standard definition"), the latter is what appears in the answer.