20,815 reputation
32575
bio website
location
age
visits member for 3 years, 4 months
seen Dec 23 at 12:28

Mar
22
revised Do any one-key-of-many cryptographic schemes exist?
added 83 characters in body
Mar
22
revised Do any one-key-of-many cryptographic schemes exist?
added 123 characters in body
Mar
21
comment Parallel-resistant proof-of-work scheme without hidden knowledge
Thanks, that helps! For randomized schemes, can't you always make them deterministic by seeding a deterministic PRNG with some seed and using its output everywhere that the algorithm makes a random choice? Now the problem/puzzle generated will be a deterministic function of the seed: the same seed always yields the same puzzle. Does that achieve what you're looking for or does it fall short in some way?
Mar
21
reviewed Needs Improvement If PGP and GPG both follow the OpenPGP standard, are they 100% compatible in all use cases?
Mar
21
reviewed Needs Improvement ASCII: weakness
Mar
21
reviewed Needs Improvement Is this approach to generating a “random” number from a sha512 hash effective?
Mar
21
comment Is this approach to generating a “random” number from a sha512 hash effective?
Good answer! I'd also like to refer the author to crypto.stackexchange.com/q/767/351.
Mar
21
reviewed Needs Improvement simple multiplication in GF(8)
Mar
21
reviewed Excellent Signature based on public key cryptography and forgery
Mar
21
reviewed Needs Improvement Certificate signature with SHA-1 and RSA: where do 1888 bits come from?
Mar
21
reviewed Needs Improvement Choice of reduction polynomial in Whirlpool's internal cipher
Mar
21
reviewed Satisfactory One-time digital signatures
Mar
21
reviewed Needs Improvement Can passwords be stored securely so that a similarity comparison can be made?
Mar
21
comment Can passwords be stored securely so that a similarity comparison can be made?
There are better answers to this question at security.stackexchange.com/q/3170/971 and security.stackexchange.com/q/36893/971 and security.stackexchange.com/q/53481/971.
Mar
21
reviewed Excellent Secure degree reduction for Shamir's secret sharing
Mar
21
answered Proving a decision was randomly made
Mar
21
answered How does compression before encryption leak info about the input?
Mar
21
answered secure integer comparison
Mar
21
comment secure integer comparison
Is it OK to reveal the offer of the winning ISP (the one with the best offer), in identity to the winning ISP? Do you care more about computation time or latency (total time)? Is it OK to do an interactive computation that involves many round of interaction if this keeps the computation time down?
Mar
21
revised Ensuring that an operation takes a relatively specific amount of time, but easily verify the result
added 150 characters in body; added 408 characters in body