Reputation
419
Top tag
Next privilege 500 Rep.
Cast close & reopen votes
Badges
3 10
Newest
 Yearling
Impact
~28k people reached

  • 0 posts edited
  • 0 helpful flags
  • 48 votes cast
Feb
3
comment Why RSA encryption key is based on modulo $\varphi(n)$ rather than modulo $n$
+1: it's Fermat's Little Theorem.
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.
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
13
comment advances in usability for cryptography/authentication
Hmm, I guess so... discussion on meta?
Jun
11
comment Is Wiener's attack on RSA extendable to larger keys with low hamming weight?
+1 for the thesis link.