| bio | website | embeddedrelated.com/blogs-1/… |
|---|---|---|
| location | Arizona | |
| age | ||
| visits | member for | 1 year, 10 months |
| seen | Oct 31 '12 at 18:26 | |
| stats | profile views | 12 |
|
Dec 5 |
awarded | Nice Answer |
|
Oct 31 |
comment |
SHA3 conference highlights? FWIW SHA-3 was awarded to Keccak earlier this month: nist.gov/itl/csd/sha-100212.cfm |
|
Jul 13 |
awarded | Yearling |
|
Mar 29 |
comment |
SHA3 conference highlights? a summary... any particular weaknesses/strengths in any of the candidates pointed out? |
|
Mar 29 |
asked | SHA3 conference highlights? |
|
Mar 6 |
awarded | Nice Question |
|
Feb 3 |
comment |
Why RSA encryption key is based on modulo(phi(n)) rather than modulo n +1: it's Fermat's Little Theorem. |
|
Aug 29 |
awarded | Critic |
|
Aug 13 |
comment |
What tests can I do to ensure my PRNG is working correctly? Hmm. Either you're talking about the statistical or cryptographic aspects of randomness. If the latter, you should make it clear. If the former, this is probably the wrong forum and the answers reflect that. |
|
Aug 10 |
comment |
How can I improve a password generation scheme based on a shared secret and URL? -1: no real explanation here, just some general assertions. |
|
Aug 2 |
awarded | Beta |
|
Jul 16 |
awarded | Commentator |
|
Jul 16 |
comment |
Is key size the only barrier to the adoption of the McEliece cryptosystem, or is it considered broken/potentially vulnerable? interesting -- that's a scheme I haven't heard of |
|
Jul 15 |
revised |
Sites to find crypto intermediate values edited tags |
|
Jul 14 |
answered | RSA with small exponents? |
|
Jul 13 |
awarded | Quorum |
|
Jul 13 |
comment |
advances in usability for cryptography/authentication Hmm, I guess so... discussion on meta? |
|
Jul 13 |
awarded | Student |
|
Jul 13 |
asked | advances in usability for cryptography/authentication |
|
Jul 13 |
awarded | Teacher |