35,000 reputation
12974
bio website
location
age
visits member for 3 years, 7 months
seen 1 hour ago

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
Sep
26
reviewed No Action Needed Are there any obvious techncial faults in F. Ruiz's 2013 URSA javascript cryptography?
Sep
26
comment Roots of polynomial in Shamir secret sharing
@user153465: the attacker cannot find any roots (unless P happens to be the trivial polynomial $P(x)=0$); this can be seen by the observation that we can take the secret polynomial $P(x)$ and replace it with $P(x+c)$ and all of the secret $x$ coordinates $x_i$ with $x_i-c$. This doesn't change what the adversary sees, but changes where the roots are.
Sep
26
answered Roots of polynomial in Shamir secret sharing
Sep
26
comment Roots of polynomial in Shamir secret sharing
In Shamir's secret sharing, a share consists of both the $x$ and $y$ coordinates of the point; in your comment, you appear to imply that you're sharing only the $y$ coordinates. Which is it?
Sep
25
comment Problem understanding the construction of block cipher distinguishers
If you understand how DES works internally, you should be able to figure it out yourself - 2 queries to the algorithm will suffice. If you want something even easier, you have 1 round of DES?
Sep
24
reviewed Looks OK what is the difference between IBE and ABE schemes
Sep
24
reviewed No Action Needed Ability to locate free sectors on an encrypted volume
Sep
24
reviewed No Action Needed Basic question about design of program with data encryption
Sep
24
reviewed Satisfactory Secure MultiParty Computation with secret inputs for secret outputs
Sep
24
reviewed Satisfactory Can you fake messages from recorded message-history?
Sep
24
reviewed Satisfactory Session-specific Symmetric Key Derivation Using SHA256
Sep
24
reviewed Satisfactory Point addition equation in projective co ordinates
Sep
24
reviewed Needs Improvement Is SRP post-quantum secure?
Sep
24
reviewed Satisfactory MAC using a modified CBC mode of operation
Sep
24
comment Problem understanding the construction of block cipher distinguishers
There is no known distinguisher for 2DES that works with less than $2^{56}$ time. I would suggest you start learning with something a tad simpler; how about you start looking for a distinguisher that works against a 2-round version of DES?