Reputation
21,849
Next tag badge:
98/100 score
23/20 answers
Badges
4 29 79
Impact
~464k people reached

May
20
answered Severity of Cooking NIST P Curve Constants
May
18
comment Is what i'm trying to do safe?
@VincentAdvocaat, what I meant was that you didn't mention you had tried specifically TLS with pre-shared keys....
May
17
comment Is what i'm trying to do safe?
@VincentAdvocaat, then you should mention that in the question. We expect you to tell us what you've considered and what you've tried in the question. No one likes taking the time to write an answer and then have the original poster come back and say "I already knew of that".
May
15
comment Is what i'm trying to do safe?
@SOJPM, pre-shared keys for TLS seem like a counterexample to the claim that TLS handshakes always require asymmetric crypto -- no?
May
15
revised Is what i'm trying to do safe?
added 108 characters in body
May
15
answered Is what i'm trying to do safe?
May
6
comment Brute-force attack given small search-space and hash prefix
This answer is incorrect. It assumes we only have 8 bits of the hash, but as the OP has clarified, we actually have 32 bits of the hash.
May
6
comment Brute-force attack given small search-space and hash prefix
I encourage you to edit the question to incorporate this information. Comments exist to help you improve the question; clarifications shouldn't be left in the comments, as they can disappear at any time, and readers shouldn't need to read the comments to understand what you're asking.
May
6
answered Brute-force attack given small search-space and hash prefix
May
6
comment Brute-force attack given small search-space and hash prefix
What's a character, in terms of bits, in your implementation? Is the output of sha1_hex() in hex, so each character is 4 bits of the hash, and the first 8 characters are the first 32 bits of the SHA1 hash?
Apr
27
comment Can cycle finding techniques reduce the memory usage of the MitM attack against 2DES and 3DES?
Yes, it works. It's a standard trick; kudos for re-discovering it. I see no reason the table size would amount to $2^{n/2}$. The complications in working out exact parameters arise when you work out the details of (a) parallelism, (b) distinguished points, (c) the cost of memory and routing networks, to get the exact optimal tradeoff (if you care about constant factors).
Apr
26
comment Adding two public keys
@RickyDemer, I don't know. I guess that's a different question. If you're suggesting that might be what the OP wanted, if so, he needs to specify his requirements or goals in the question. Right now the question only asks for "another, more widely used" scheme. I can only answer the question that was asked....
Apr
26
comment Is there are code hidden in Wired Magazine's December 2014 Issue?
@jww, are you sure you've got the right site? This question is clearly off-topic for PP&CG: codegolf.stackexchange.com/help/on-topic
Apr
26
answered Adding two public keys
Apr
15
awarded  Popular Question
Apr
9
awarded  Guru
Apr
8
awarded  Nice Answer
Apr
5
comment Will ANY prior knowledge assist in determining contents of a SHA1 hash?
@InfernusDoleo, you'll be fine, if that 26-character secret key is truly secret and chosen uniformly using a crypto-quality randomness source. That large secret key means that the space of candidate inputs is very large, so brute-force won't work. The fact that you can see many outputs with related inputs doesn't help given that the secret key is so large.
Apr
4
comment Will ANY prior knowledge assist in determining contents of a SHA1 hash?
@InfernusDoleo, I can't answer that, because it's not clear what you intend the full input to the hash to be. If you want a more detailed answer, list all the parts of the input to the hash and what is known about each. An incrementing nonce counts as a known/predictable part of the input, since it can be predicted.
Apr
4
answered Will ANY prior knowledge assist in determining contents of a SHA1 hash?