131 reputation
8
bio website
location
age
visits member for 10 months
seen 9 hours ago

Oct
15
accepted Can Diffie-Hellman be scaled up or force-multiplied?
Oct
14
awarded  Commentator
Oct
14
comment Can Diffie-Hellman be scaled up or force-multiplied?
Updated, removed keyfile example, focused on desired effect.
Oct
14
comment Can Diffie-Hellman be scaled up or force-multiplied?
@CodesInChaos Oh, I didn't know it would take that long. Yeah, thats totally not acceptable. I assumed the good-guy's computation would be faster because they don't have to brute-factor. Like I said don't assume I know what the performance would be like. I should probably abstract the example of implementation from the desired effect.
Oct
14
comment Can Diffie-Hellman be scaled up or force-multiplied?
@CodesInChaos I thought that the key-exchange process was only needed to secure or 'wrap' a more traditional shared secret like a 512 bit key? Is that not the case?
Oct
14
comment Can Diffie-Hellman be scaled up or force-multiplied?
@LateralFractal Yeah I know that quantum computing wont trivialize traditional encryption, but I've heard that the factoring of diffie-hellman shared secrets are one of the things that it will theoretically trivialize.
Oct
14
asked Can Diffie-Hellman be scaled up or force-multiplied?
Jul
8
comment When only using one-way hashing, is it possible to tell the number of characters changed between the old and new password?
Short answer: Nope.
Jul
8
comment Adi Shamir's secret database of all primes
It exists, but you can't select from it because the programmer forgot to put a with(nolock) on the insert sproc.
Jul
2
comment Attacks on AES-128 (ECB) based on some knowledge of plaintext
The only thing that looked questionable was the CTR mode but after looking into it a little, CTR mode seems legit, nothing to worry about. So, looks good to me.
Jun
30
awarded  Citizen Patrol
Jun
19
revised What algorithm would give the shortest ciphertext for very short plaintexts?
added 357 characters in body
Jun
19
awarded  Editor
Jun
19
revised What algorithm would give the shortest ciphertext for very short plaintexts?
added 357 characters in body
Jun
19
answered What algorithm would give the shortest ciphertext for very short plaintexts?
Jun
19
awarded  Supporter
Dec
18
comment Would it be possible to create a game where one would need to decrypt a simple encryption?
en.wikipedia.org/wiki/XOR_cipher About as simple as it gets. The problem you'll run into with any encryption method is that, as far as I know, you won't be able to know if you're warm or cold until you've finished.
Dec
17
comment Would it be possible to create a game where one would need to decrypt a simple encryption?
Well an easy way to tell if you are getting closer to the original value of foo would be to append a hash after every step in the encryption. So you can check the hash to the encrypted string and if they match, they you're one step closer to foo.
Dec
17
awarded  Teacher
Dec
17
answered Would it be possible to create a game where one would need to decrypt a simple encryption?