meta user
network profile
| bio | website | pwnhome.wordpress.com |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 1 year, 8 months |
| seen | 2 hours ago | |
| stats | profile views | 66 |
I like crypto. Need I say more?
|
3h |
awarded | Convention |
|
11h |
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? |
|
11h |
reviewed | Approve suggested edit on Decrypting the Encrypted hex applcation data with encryption keys |
|
11h |
comment |
Decrypting the Encrypted hex applcation data with encryption keys Sorry we don't analyze data on this site see the FAQ. |
|
1d |
reviewed | Leave Open Is the likelihood of a birthday collision linear (evenly distributed) for all ciphers? When are they not? |
|
1d |
reviewed | No Action Needed Why is SRP not widely used? |
|
2d |
reviewed | Close calculating beta for elgamal elliptic curves |
|
2d |
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). |
|
2d |
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? |
