meta user
network profile
| bio | website | kevinmontrose.com |
|---|---|---|
| location | New York City, New York | |
| age | ||
| visits | member for | 1 year, 10 months |
| seen | May 15 at 17:15 | |
| stats | profile views | 6 |
Stack Overflow Valued Associate #00004
For no good reason, I'm on twitter. I hear its compelling... somehow.
I also have a blog.
|
Dec 26 |
accepted | Why does Fortuna (RNG) require entropy sources to specify accumulator pool? |
|
Dec 25 |
comment |
Why does Fortuna (RNG) require entropy sources to specify accumulator pool? @CodesInChaos yes, an evil source could only direct its own input. I don't think Fortuna is broken or anything, just seemed odd to allow entropy sources to direct their events and was unsure why that is. |
|
Dec 25 |
comment |
Why does Fortuna (RNG) require entropy sources to specify accumulator pool? @codesinchaos that it would take more events (since it'd have they'd be evenly distributed, outside of the sources control) to force many events into one pool. |
|
Dec 24 |
comment |
Why does Fortuna (RNG) require entropy sources to specify accumulator pool? Off hand it seems like a process id (or equivalent kernel handle, if entropy sources are drivers) would be a pretty decent sourceId. But I guess the take away is that it's an engineering decision, not a cryptographic one then. |
|
Dec 24 |
asked | Why does Fortuna (RNG) require entropy sources to specify accumulator pool? |
|
Aug 13 |
awarded | Scholar |
|
Aug 13 |
accepted | Existing works on pre-computing ElGamal ephermal keys |
|
Aug 7 |
comment |
Existing works on pre-computing ElGamal ephermal keys @CodesInChaos this is all related to the "Improvements" section, so I don't think a link would contribute much and bordered on self-promotion. I didn't even really explain ElGamal in that post. |
|
Aug 7 |
comment |
Existing works on pre-computing ElGamal ephermal keys I've already told you this, but for the public record, I'll play with the math and see what working out $A_y$ requires (such that the decryption is believable) when you know everything else. |
|
Aug 7 |
revised |
Existing works on pre-computing ElGamal ephermal keys oy, bad typo |
|
Aug 6 |
awarded | Student |
|
Aug 6 |
revised |
Existing works on pre-computing ElGamal ephermal keys calling out what I mean by "approach", first comment may mean that's a bit ambiguous. |
|
Aug 6 |
comment |
Existing works on pre-computing ElGamal ephermal keys @poncho - outside the scope of this particular question, but in a practical system there's a zero-knowledge proof that can be constructed for ElGamal ciphertexts proving the plaintext falls in a range (in this case [0,1]). |
|
Aug 5 |
awarded | Editor |
|
Aug 5 |
revised |
Existing works on pre-computing ElGamal ephermal keys added 67 characters in body |
|
Aug 5 |
asked | Existing works on pre-computing ElGamal ephermal keys |
|
Aug 18 |
awarded | Supporter |
