croikle

7 ms·

31.
by croikle 13y ago
> and I'm not entirely sure if those key-ID's are sufficiently unique and/or secure They aren't: http://www.asheesh.org/note/debian/short-key-ids-are-bad-new...
32.
by croikle 13y ago
There is some research in this area, e.g. http://www.cs.berkeley.edu/~dawnsong/papers/se.pdf
33.
by croikle 13y ago
This is why all worthwhile encryption schemes are nondeterministic, incorporating randomness. If you encrypt the same data twice with GPG, the results will not be the same.
34.
by croikle 13y ago
Limiting the energy source to a single star is weak. If you use a whole galaxy (or several) you can easily bring that up to 256 bits. For example, the Milky Way has on the order of 10^11 stars; most of those aren't supernova-sized, bu
35.
by croikle 13y ago
To expand on this a little, 256-bit RSA is easily crackable, since there are good algorithms for integer factorization. You need a significant increase in key length to get equivalent security to symmetric keys: Wikipedia claims 3072-bit RS
36.
by croikle 13y ago
$('.region').style.visibility="visible" to show content without running their js.
37.
by croikle 13y ago
Yep, they're still rather vulnerable. I guess their approach would stop a dumb MitM which just replaces any .exe download. It also protects against the download server being compromised, assuming the original server is fine and your
38.
by croikle 13y ago
The yottabyte stuff is basically BS. HN user Jabbles found a possible source for that, which just says '''The target GIG supports capacities exceeding exabytes (10^18 bytes) and possibly yottabytes (10^24 bytes) of data.&#x27
39.
by croikle 13y ago
Submission is at https://news.ycombinator.com/item?id=5825443 if anyone would like to support it. kweks: Posts start on 'new', and only rise to the front page if they get enough traction. Unfortunately, yours has been missed so far.
40.
by croikle 13y ago
They could hash substrings or variations of the new password and check against the original hash. Further, I guess they could be storing hashes of several modified passwords, but that seems unlikely.
41.
by croikle 13y ago
http://www.inutile.ens.fr/estatis/password-security-checker The Terms and Conditions are worthwhile, too. EDIT: Also, see http://www.ismytwitterpasswordsecure.com/ (needs Javascript)
42.
by croikle 13y ago
Note that results like this [0] tend to be for generalizations. '''It is natural to generalize the Tetris gameboard to m-by-n, since a relatively simple dynamic program solves the case of a constant-size gameboard in time polynomial in the
43.
by croikle 13y ago
A good reason to use something like RequestPolicy [0]. I'd rather not tell LinkedIn, Facebook, etc., about everything I read. [0] https://www.requestpolicy.com/ https://addons.mozilla.org/en-US/firefox/addon/requestpolicy...
44.
by croikle 13y ago
The highlighted instances of "kerning" have extra letter-spacing.
45.
by croikle 13y ago
Interestingly, that's quite similar to cookingrobot's. [ https://news.ycombinator.com/item?id=5709406 ]
46.
by croikle 13y ago
The world is finite, so every drawing eventually loops. However, the state space is something like k * 2^18 * n^(2^18), where k is the number of states and n the number of symbols. For the default (4, 3) this is 3.125 * 10^125080, so you co
47.
by croikle 13y ago
PDF.js doesn't use emscripten, as far as I can tell. For a recent example of emscripten, try this one from yesterday: https://news.ycombinator.com/item?id=5673356