31,097 reputation
12463
bio website
location
age
visits member for 3 years, 2 months
seen 1 hour ago

Mar
21
reviewed Edit suggested edit on sha-256 tag wiki
Mar
21
revised sha-256 wiki description
brief explanation of how SHA-256 fits in the SHA-2 family
Mar
21
reviewed Approve suggested edit on sha-512 tag wiki excerpt
Mar
21
reviewed Edit suggested edit on sha-512 tag wiki
Mar
21
revised sha-512 wiki description
brief explanation of how SHA-512 fits in the SHA-2 family
Mar
21
comment Soundness idea of basic zero knowledge prood
@tylo: yeah, I did replace |G| with n-1, and I ought to have at least noted why. The protocol was written as a MODP group; it wasn't specified that n was prime; however since it assumes the prover knows |G|, that means that the factorization of n is known.
Mar
21
comment Soundness idea of basic zero knowledge prood
Most ZKP's I've seen allow a 0.5 probability per round of accepting a false statement; that is consistent with your "any even challenge to result in acceptance".
Mar
20
revised Proving a decision was randomly made
added 25 characters in body
Mar
20
answered Proving a decision was randomly made
Mar
20
revised Proving a decision was randomly made
edited tags
Mar
20
comment Soundness idea of basic zero knowledge prood
@DavidCash: no, I am saying that there are statements for which no ZKPoK exists, and one such statement is $\exists x: g^x = h$ (at least, we don't think so; if either the DLP and factorization problem is easier than we think, the above statement may be trivial). There does exist a ZKPoK proof that "I know such a value $x$", however that's not the statement that was originally claimed.
Mar
20
answered Soundness idea of basic zero knowledge prood
Mar
20
comment Soundness idea of basic zero knowledge prood
Zero knowledge proofs do not insist that a challenge be accepted only if the proposition being proved is true; in fact, they require that someone be able to generate a valid-looking transcript even if the proposition was false.
Mar
20
comment Is the term “Elliptic Curve Discrete Logarithm Problem” a misnomer?
@PGodbole: actually, we are being precise; ECDLP means the problem "given the EC points $G$, and $nG$, find $n$", and nothing else. What it is not is consistent; we talk about the elliptic curve operation as analogous to "addition" everywhere except for ECDLP.
Mar
19
comment Public-key based on roots of polynomial
With an infinite field, $P(x)$ may not be expressible in a fixed number of bits (or, depending on the field, even a bounded number of bits). That puts rather a crimp in the cryptographical applications.
Mar
19
comment Public-key based on roots of polynomial
Actually, it is easy to compute the roots of a polynomial $P(x)$ defined over a finite field.
Mar
18
revised Is the term “Elliptic Curve Discrete Logarithm Problem” a misnomer?
added 19 characters in body
Mar
18
revised Is the term “Elliptic Curve Discrete Logarithm Problem” a misnomer?
Minor corrections
Mar
18
answered Is the term “Elliptic Curve Discrete Logarithm Problem” a misnomer?
Mar
17
revised Meet in the middle attack - message and key
deleted 1 characters in body