Viewing profile — periodontal

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 …

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

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 …

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…

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 …

For bash, add quotes: "${cmd[@]}" Otherwise, you'll get word splitting. E.g., cmd=( test "!= !=" != "" ) "${cmd[@]}" && echo Success ${cmd[@]} || echo Failure

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 b…

Of course, even your example units don't always behave like you want. For velocities, 150 megameters/second + 150 megameters/second ≈ 240 megameters/second.

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 re…

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 …

2147483647 + 1 is congruent to -2147483648 modulo 4294967296.

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…

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 firm…

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, wi…

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 …

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 …

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 disclosur…

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 th…

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).…

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 th…

> 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…

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 t…

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 …

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 need…