3,330 reputation
11127
bio website
location Tennessee
age 21
visits member for 2 years, 2 months
seen 2 days 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.


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.
Apr
19
revised Is there a reason that the N value in scrypt is limited to powers of two?
fix minor typo
Mar
17
revised What prevents a padding standard to cause a data loss?
Fix spelling of 'standard'
Mar
12
comment How does the key size per data bit influence the security?
It will take $2^{127}$ tries on average, not $2^{64}$. If the probability of each guess being correct is $1/2^n$, it takes $2^n / 2 = 2^{n-1}$ guesses to have a 50% chance of success.
Mar
9
comment Using a hash with a constant key to create easily verifiable codes
Well, I have two problems with this answer: (1) it doesn't mention HMAC, which the question just screams to recommend IMO, and (2) it suggests signing a digest of the message, which should already be handled by the signature's padding scheme.
Mar
9
comment Finding an x such that xP = (11,44) on an elliptic curve
Some folks write curve points with uppercase letters.
Mar
5
comment Any use for now-defunct Mt Gox Yubikey?
48 bits is not a whole lot. I don't know much about the system is setup, but could you possibly brute-force that?
Mar
5
revised Is it possible to calculate the 'skeleton key' for DUAL_EC_DRBG? What would it take?
Fix typo
Mar
5
answered Is it possible to calculate the 'skeleton key' for DUAL_EC_DRBG? What would it take?
Mar
4
revised Is it possible to calculate the 'skeleton key' for DUAL_EC_DRBG? What would it take?
Fixed typo in title
Feb
19
answered Necessity of changing $p$ and $q$ when your private key is exposed?
Feb
15
comment The difference between these 4 breaking Cipher techniques?
Hmm, (re)reading this answer, perhaps it would be prudent to reorder these from weakest to strongest, so that each attack builds on the previous one. (That is the typical presentation.) I think this answer might serve in the future as a useful high-level reference for the different attack types. I've noticed that the associated Wikipedia article(s) are of particularly poor quality in that department.