periodontal

5 ms·

1.
by periodontal 9mo ago
For an easy strategy, guess all zeros at first. Call resulting distance E1 and let S1 = E1 × E1. Now guess with X = 1, rest still zero, obtaining S2. We can calculate X = (S1 - S2 + 1)/2. Now guess (X, 1, all zeroes). Do the same calcu
2.
by periodontal 4y ago
This is probably due to the underlying filesystem being case insensitive on Mac. As a hack, you can create a symlink alias on a per repo basis. ln -s HEAD .git/head
3.
by periodontal 4y ago
Basically, hash all your data items, keep track of the maximum number of leading 0 bits seen in a hash so far. This is a decent proxy (but not without error) for how many distinct items you've seen so far since large numbers of leading
4.
by periodontal 5y ago
You might also try maximum instead of average. This is minimax and represents worst case scenarios for each guess. This is mostly useful for optimal play against an opponent (which is not the case here). Imagine an adversarial version whe
5.
by periodontal 5y ago
You can get something somewhat similar with "always create merge commit" workflows (no fast forward) and changing your tooling to look at the first-parent-history by default. This view will have one commit per merge, but you can
6.
by periodontal 6y ago
For bash, add quotes: "${cmd[@]}" Otherwise, you'll get word splitting. E.g., cmd=( test "!= !=" != "" ) "${cmd[@]}" && echo Success ${cmd[@]} || echo Failure
7.
by periodontal 6y ago
Due to the Leidenfrost effect, incidental contact of bare skin and LN2 is not usually a problem (it boils off locally and creates a gaseous N2 barrier). Other things superchilled by it will not be as forgiving, however. http://c
8.
by periodontal 6y ago
Of course, even your example units don't always behave like you want. For velocities, 150 megameters/second + 150 megameters/second ≈ 240 megameters/second.
9.
by periodontal 9y ago
This is a specific example of an Exact cover problem: https://en.wikipedia.org/wiki/Exact_cover If you haven't seen Knuth's Dancing Links implementation of Algorithm X, I highly recommend it. It's base
10.
by periodontal 10y ago
If the extra initial scrutiny is perceived to streamline the process and avoid further hassles, many will hand it over without giving it a second thought. For example, many people have voluntarily submitted fingerprints in order to enroll i
11.
by periodontal 10y ago
2147483647 + 1 is congruent to -2147483648 modulo 4294967296.
12.
by periodontal 11y ago
The same way we create and vet conventional cryptography: withstanding public scrutiny of experts until we are reasonably confident that there are no major issues. Most attacks are theoretical and require only novel analysis and a new boun
13.
by periodontal 11y ago
It's certainly possible to design such a system with external firmware and still allow for secure updates. The enclave would store (in secured storage) a hash of the last used firmware. Hardware would have a hash update capability, bu
14.
by periodontal 11y ago
The reasoning there is far from conclusive. The argument is that the secure enclave has been updated in the past (to lengthen enforced delays) without wiping user keys. However, without more information, this does not tell us whether it is
15.
by periodontal 11y ago
While theoretically possible, it'll be very difficult to realize physically. If you allow fractal constructions, purely unrectifiable sets can fit the bill. For example, here's an example in 2-dimensional space that casts a soli
16.
by periodontal 11y ago
They destroyed it ostensibly so that they had a stronger guarantee that that GUID would never be generated again. That said, I suspect they understood it wasn't strictly necessary and were looking for an excuse to have some fun. Note
17.
by periodontal 11y ago
Per-user voting history in many (most?) states. The fact that a ballot was received from a particular voter (but not what they voted for) is often releasable under public disclosure laws.
18.
by periodontal 11y ago
I agree that the oracle of hindsight can often lead us astray. However, in 2007, it wasn't just known that you could implement a backdoor, but how to do so. This of course means that any constants generated after this point could not
19.
by periodontal 11y ago
The backdoor possibility was known in 2007 and the standard included a way to set your own constants (which no one used, true, but just because it was true for Dual EC in general). I disagree that following the standard on that point and cr
20.
by periodontal 11y ago
Basically, Dual EC is never something you'll choose willingly, given alternatives (it's quite slow and has had a slight bias demonstrated). So no one* did in practice. This made the backdoor almost a non-issue (so no heartbleed-
21.
by periodontal 11y ago
> This backdoor appears to swap out the public key, which is something NSA has no interest in doing. While they wouldn't need to swap it out (since they can unlock standard Dual EC), that doesn't mean they wouldn't. Assumi
22.
by periodontal 11y ago
See the last section (Afterword: removing the hat): First, in case this is not obvious to the reader, we do not actually endorse the attacker's perspective. Our goal in analyzing the security of systems is to prevent attacks.
23.
by periodontal 11y ago
One point this doesn't (appear to) consider is the type of vulnerability which is possible to embed. Forcing a curve parameter with the prefix 0xBADA55 is eminently feasible given the many available design choices (as this shows, thou
24.
by periodontal 11y ago
PFS will make it so connections need to be individually attacked but since most PFS is done with Diffie-Hellman variants (susceptible to Shor's algorithm), the group size also needs to be large enough to resist early quantum computers.
25.
by periodontal 11y ago
CRT is often given with a closed form for the satisfying solution, although requiring computing multiplicative inverses mod each of the n_i (your primes). Since all of these values are known at design time, they can be precomputed and the
26.
by periodontal 11y ago
The fastest way to encode these dense bitpackings is almost certainly with the Chinese remainder theorem.