3,575 reputation
11231
bio website
location Tennessee
age 21
visits member for 2 years, 6 months
seen 9 hours ago

I'm an aspiring cryptographer. Other interests include software engineering and Linux-based system administration.

I can be contacted at: reid [at] rwiggins [dot] net.


10h
revised 1 Billion Bit Encryption?
fixed misinterpretation of quote
20h
answered 1 Billion Bit Encryption?
2d
revised In ECC, how do I prove that point addition is commutative?
Fix "Epiletic" curve typo, correct some awkward phrasing, MathJaX-ify the math, and remove the closing "Thanks"
Jan
20
comment How much (home PC) CPU time is required to generate a prime number of a given size?
@K.G.: Ah, well, I did not intend for this post to really contain a serious prime-finding algorithm; rather I wanted to demonstrate that asymptotically, the task is not difficult, and real world improvements (like your suggestion) make that analysis messier.
Jan
10
revised How much (home PC) CPU time is required to generate a prime number of a given size?
actually answer the question
Jan
10
answered How much (home PC) CPU time is required to generate a prime number of a given size?
Nov
17
awarded  Enlightened
Nov
17
awarded  Nice Answer
Oct
13
awarded  Announcer
Sep
30
awarded  Explainer
Sep
24
awarded  Autobiographer
Aug
13
awarded  Enlightened
Aug
13
awarded  Nice Answer
Jul
6
awarded  Yearling
Jul
4
comment Getting 88bytes cipher output from 48bytes input in AES
Wow. That paper is....... poor. Like, really poor.
Jun
23
comment How to adjust scrypt parameters for Moore's Law?
Those tests were performed in 2009, from what I remember, so Moore's law has not yet much touched those numbers.
May
18
revised Why is XOR preferred over XNOR?
Change ‘not XOR’ to ‘XNOR’, which makes the text somewhat easier to follow IMO
May
4
comment Difference between a nonce and IV
Indeed; in particular I tend to assume that, if the scheme wants a nonce, I can safely use a counter. On the other hand, IVs can sometimes break things if they're predictable (e.g., CBC mode).
May
3
revised Security strength of RSA in relation with the modulus size
Clean up Mathematica code a bit, add a brief explanation of it for the uninitiated
May
1
comment How to argue to a paranoid that RSA is safe?
An unreasonably paranoid point of view, perhaps. But none of those are terribly concerning or relevant: (1) we don't have a quantum computer capable of factoring anything near RSA-size semiprimes yet; (2) no, secure key sizes cannot be broken using a very large cluster by definition; otherwise they would be insecure (and we can 'simply' ramp up key size until security is met); (3) physical attacks are outside the purview of an asymmetric cryptosystem (mostly). Is RSA perfect? No - but the above are not really compelling imperfections.