Reputation
439
Top tag
Next privilege 500 Rep.
Access review queues
Badges
3 11
Newest
 Nice Answer
Impact
~39k people reached

  • 0 posts edited
  • 0 helpful flags
  • 49 votes cast
Nov
9
awarded  Nice Answer
Apr
20
awarded  Yearling
Dec
5
awarded  Nice Answer
Jul
13
awarded  Yearling
Mar
6
awarded  Nice Question
Feb
3
comment Why is RSA encryption key based on modulo $\varphi(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
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
Jul
13
answered How can I generate large prime numbers for RSA?
Jul
13
awarded  Precognitive