network profile
| bio | website | op.to/sO+ |
|---|---|---|
| location | Taipei & Hong Kong | |
| age | 29 | |
| visits | member for | 9 months |
| seen | Feb 6 at 9:37 | |
| stats | profile views | 0 |
There's no such thing as "beautiful code"
Beauty is in the design, the concept, the algorithm.
The closer you approach the design, the concept, the algorithm -- the more beautiful the code, but the code itself is never beautiful.
|
Feb 3 |
comment |
Why would this method of discrete logarithm finding not work? Okay I see the logic of your reasoning. It seem I do not have something here. |
|
Feb 2 |
comment |
Any efficient text-based steganographic schemes? You could automatically replace words with 'synonyms'. I'm sure it would if it was very frequent. Although there must be lots of activity on there anyway. If you need high thruput...maybe a network of twitter robots faithfully reposting various news articles 24/7....there's enough content and control in such a stream you could set up some stego on it. |
|
Feb 2 |
comment |
Why would this method of discrete logarithm finding not work? Cool, thanks for the suggestion. I will do this eventually. |
|
Feb 2 |
revised |
Why would this method of discrete logarithm finding not work? deleted 1 characters in body |
|
Feb 1 |
answered | Any efficient text-based steganographic schemes? |
|
Feb 1 |
comment |
Why would this method of discrete logarithm finding not work? Thanks for that, that is really awesome! (b^i).F just means F multiplied by ith power of b. It looks good. |
|
Feb 1 |
awarded | Student |
|
Feb 1 |
asked | Why would this method of discrete logarithm finding not work? |
|
Jan 31 |
awarded | Commentator |
|
Jan 31 |
comment |
How to best obtain bit sequences from throwing normal dice? Good point. I didn't see that. |
|
Jan 31 |
comment |
Discrete log analog of ECM factoring algorithm? The exponent of a factor of g (g = b**k) is smaller than k. |
|
Jan 31 |
awarded | Teacher |
|
Jan 31 |
comment |
Discrete log analog of ECM factoring algorithm? It is kind of equivalent. If you take m = b**i n = b**j and compute mn mod p, finding i+j is the discrete log. So if you can factor mn mod p, where one factor is a known power of b, that reduces the problem to determining the exponent of the other factor, which is by definition smaller (outside of its congruence class mod p). |
|
Jan 31 |
answered | How to best obtain bit sequences from throwing normal dice? |
|
Jan 31 |
comment |
How to best obtain bit sequences from throwing normal dice? How best to ? Slowly. |
|
Jan 31 |
revised |
Question about use of IV in this cipher corrected description |
|
Jan 31 |
comment |
Question about use of IV in this cipher @StephenTouset Yes, I will. Thanks. |
|
Jan 30 |
comment |
Question about use of IV in this cipher Thanks I'll check that. |
|
Jan 30 |
comment |
Question about use of IV in this cipher Why should it be so independent? |
|
Jan 30 |
awarded | Scholar |
