31,053 reputation
12463
bio website
location
age
visits member for 3 years, 2 months
seen 2 hours ago

Oct
1
answered Known-plaintext attack on two-dimensional affine cipher
Oct
1
comment A variant of Shamir secret sharing
@user153465: if my edits to the question were inaccurate, please go ahead and reedit the question.
Oct
1
comment A variant of Shamir secret sharing
I tried to make your question more understandable; if I garbled it, or misinterpreted it, feel free to roll back my changes.
Oct
1
revised A variant of Shamir secret sharing
Tried to make the question understandable
Oct
1
comment Small Encryption Exponent
I suspect that the smallness of the encryption exponent has nothing to do with it; instead, consider the modulus, which is approximately circa 372 bits long; how can you take advantage of that?
Oct
1
reviewed Leave Closed Is One Time Pad something like this?
Sep
30
awarded  Explainer
Sep
30
awarded  Enlightened
Sep
30
awarded  Nice Answer
Sep
30
reviewed Close Question about second preimage resistance of hash function combiner
Sep
30
reviewed Close Cipher built from GPU primitives
Sep
29
reviewed No Action Needed Why should CAST5 and 3DES not be used for encrypting files over 4GB?
Sep
29
comment Roots of polynomial in Shamir secret sharing
@user153465: that would depend greatly on your security goals. If your goals can be summarized as "can't find where the roots are", what you have is sufficient. If they go beyond that, well, what's needed might depend on what the security goals actually are.
Sep
26
comment Roots of polynomial in Shamir secret sharing
@user153465: to the question "can the adversary find ... even a root...", I answered he "cannot find any roots (except in one specific case)". I don't know how to make it any more clear than that; the observation was that, given a specific $P$ (with roots at specific locations) and $x$ values, we can find a $P'$ and $x'$ values with $P(x)=P'(x')$; $P'$ has roots at different locations, however the adversary sees only $P(x) = P'(x')$, hence he has no information whether he's dealing with $P$ or $P'$.
Sep
26
comment Determining average number of hash calls to get a hash that begins with X
@e-sushi: I disagree that this is "opinion based"; it has a definite answer; and while the exact answer would depend on whether "on average" means the median (how long it takes to get to 50% probability), or the mean (or expected value, which is what people generally mean by 'average' in most contexts), it has a precise answer in either case. However, if you say "this is really something for the math stackexchange", well, I don't disagree with you there
Sep
26
reviewed Leave Open Determining average number of hash calls to get a hash that begins with X
Sep
26
comment Is deniable error-correction possible?
@RickyDemer: you're parsing it wrong: "the encoding of a string (that cannot be distinguished from random) cannot be distinguished from random". He's asking if the encoding can be made indistiguishable (and the answer is easy if Alice and Bob share a secret)
Sep
26
revised Determining average number of hash calls to get a hash that begins with X
Sorry about the English nit but it was bothering me -- "bare with me" means "lets get naked together"
Sep
26
comment Determining average number of hash calls to get a hash that begins with X
Better, but it still doesn't answer "what is the average (expected) time". Unfortunately, evaluating that precisely would appear involve evaluating an infinite sum, and while that's not that difficult with the right trick, evaluating infinite sums might not be what mcdoomington is really interested in (especially since when talking about infinite sums, you need to explain when these tricks are safe and when they are not...)
Sep
26
reviewed Leave Closed stream cipher computation cost