12,760 reputation
21656
bio website pwnhome.wordpress.com
location
age
visits member for 2 years, 7 months
seen 8 hours ago

I like crypto. Need I say more?


May
23
awarded  Convention
May
23
reviewed Approve suggested edit on What is the fastest elliptic curve operation f(P) in affine coordinates such that f^n(P)=P only if n is large?
May
22
reviewed No Action Needed Why is SRP not widely used?
May
21
reviewed Close calculating beta for elgamal elliptic curves
May
21
comment calculating beta for elgamal elliptic curves
I'm going to close this for now. Please update to address exactly what you don't understand from the question I linked to above. Then we can reopen (just flag the question).
May
21
reviewed Approve suggested edit on Do I need to keep a 64-bit version number secret?
May
16
comment Understanding Feldman's VSS with a simple example
I think wikipedia is referring to the fact that if $g$ is a generator of $\mathbb{Z}_p^*$, then $(g^s \mid p)$ leaks the least significant bit of $s$ (HAC 3.9.1). Wikipedia only suggests choosing $g$ with prime order $q$ where $q\mid p-1$ in a parenthetical statement as kind of an afterthought. I'm assuming that is why they say $g^s$ leaks information.
May
16
revised Understanding Feldman's VSS with a simple example
fixed a mistake using t instead of q
May
16
comment Understanding Feldman's VSS with a simple example
Choosing $p,q$ in this manner ensures that the Legendre symbol of the secret $s$ is not leaked by the commitment $g^s$, correct? Specifically, the article on Wikipedia says the description of Feldman's VSS as written there is not secure as $g^s$ leaks information about $s$ (which I'm assuming is the Legendre symbol). Does choosing $p,q$ as you specify fix this problem?
May
15
comment calculating beta for elgamal elliptic curves
The equations are in the answers I linked to. What exactly don't you understand.
May
15
comment calculating beta for elgamal elliptic curves
crypto.stackexchange.com/questions/3907/… might help too.
May
15
comment calculating beta for elgamal elliptic curves
$\alpha+\alpha+\alpha+\alpha+\alpha+\alpha+\alpha$
May
13
comment Why is the discrete log problem easy when the exponent comes from a binomial distribution?
I'd add that lookup tables are especially useful here too. You must be willing to use more space, but for small plaintext spaces, it is very feasible.
May
13
reviewed Approve suggested edit on Why is the following RSA PRNG cryptographically secure?
May
13
revised Why is the following RSA PRNG cryptographically secure?
added 115 characters in body
May
13
comment Why is the following RSA PRNG cryptographically secure?
@Maeher, yes, let me reword to make it clear. Thanks for pointing that out.
May
13
answered Why is the following RSA PRNG cryptographically secure?
May
11
revised Finding hash almost-collisions
deleted 123 characters in body
May
10
comment Finding hash almost-collisions
@0xFE, if the problem is massively parallelizable, then hardware can make a huge difference. See cs.rit.edu/~ark/parallelcrypto/sha3test01 for more info (including some code).
May
10
revised Finding hash almost-collisions
deleted 254 characters in body