network profile
| bio | website | sup3rgnu.se |
|---|---|---|
| location | Singapore, Singapore | |
| age | 26 | |
| visits | member for | 1 year |
| seen | Jun 30 '12 at 10:34 | |
| stats | profile views | 6 |
|
Jun 9 |
accepted | Does a hash function in chaining mode or in counter mode make a better pseudo-random number generator? |
|
Jun 9 |
asked | Does a hash function in chaining mode or in counter mode make a better pseudo-random number generator? |
|
May 25 |
comment |
Finding a solution to a (sort of) discrete logarithm by asking questions Thanks man, I don't fully get it but def have a better picture now, thanks a lot appreciate it! |
|
May 25 |
accepted | Finding a solution to a (sort of) discrete logarithm by asking questions |
|
May 21 |
comment |
Finding a solution to a (sort of) discrete logarithm by asking questions Ok, we can say that k is smooth, so all of k's prime factors will be no greater than log n. How do I get from that to figuring out g which I guess is needed if I would try @jug's suggestion u = g^{p/r} ? "By inspection, and assemble those using the CRT" Could index calculus be used for this? Thanks for the tips so far, it's taking me some time to understand the whole picture here. |
|
May 21 |
comment |
Finding a solution to a (sort of) discrete logarithm by asking questions @jug how would I try $u = g^{p/r}$ when I don't know $g$ or can I use $y$ divided by something? |
|
May 21 |
comment |
Finding a solution to a (sort of) discrete logarithm by asking questions @fgrieu I'm thinking that $log$ $k = n$ might be a typo in the original question, that it should be $log$ $p = n$ it doesn't really make sense to have $q = k$, I've asked but haven't got an answer yet. |
|
May 21 |
revised |
Finding a solution to a (sort of) discrete logarithm by asking questions deleted 3 characters in body |
|
May 21 |
comment |
Finding a solution to a (sort of) discrete logarithm by asking questions yes, $log_2$ and the second one is a typo, supposed to be $log$ $k = n$ (wasn't even a typo the block quote > messed it up.. |
|
May 20 |
asked | Finding a solution to a (sort of) discrete logarithm by asking questions |
|
May 20 |
awarded | Supporter |
|
May 20 |
awarded | Scholar |
|
May 20 |
comment |
Lamport signature: How many signatures are need to forge a signature? Thank you for good explanation! |
|
May 20 |
accepted | Lamport signature: How many signatures are need to forge a signature? |
|
May 20 |
awarded | Student |
|
May 20 |
asked | Lamport signature: How many signatures are need to forge a signature? |
|
May 19 |
awarded | Editor |
|
May 19 |
revised |
What is the relation between Discrete Log, Computational Diffie-Hellman and Decisional Diffie-Hellman? Typo in y^3 = g^x1·x3 I think it's supposed to be x1*x2 |
|
May 19 |
suggested | suggested edit on What is the relation between Discrete Log, Computational Diffie-Hellman and Decisional Diffie-Hellman? |
