Sjlver

4 ms·

1.
by Sjlver 2y ago
For a start, it supports TypeScript. And it can install npm packages. And you get all the node.js APIs: for example, you can read/write files on the local hard drive.
2.
by Sjlver 3y ago
The tables are public knowledge. Memorizing them does not give you any extra security. It might hide the fact that you are using psst. This might make you less of a target for attacks (but probably has a very small or zero effect). It also
3.
by Sjlver 3y ago
Both versions of your code generate the same polynomials (i.e., rows of the table), but in a different order. The order doesn't affect psst. This is why each page of the worksheet shows the polynomials in the order that's most con
4.
by Sjlver 3y ago
Yes. The 25 rows of the table correspond to the 25 linear polynomials in GF(5), evaluated at x=0, 1, 2, 3, and 4. GF(5) is the "field" that psst uses. It just means that all math is performed using only digits 0 to 4, and we take
5.
by Sjlver 3y ago
Alas, psst can't help with that. With psst (or indeed any secret sharing scheme), there is a single secret which is only split while at rest. In order to actually make use of the secret, it needs to be recovered from the shares. Your u
6.
by Sjlver 3y ago
Nice! I like the idea of washers on a bolt. One could conceivably purchase five different sizes to make your idea compatible with psst. A similar idea also exists as a commercial product: https://jlopp.github.io/metal-bitcoi
7.
by Sjlver 3y ago
Thanks for the link! I hadn't known about these projects. Superbacked and psst have a similar starting point, but end up being quite different: Superbacked is a company selling you a backup service for small secrets. They offer a fair
8.
by Sjlver 3y ago
Very cool! When designing psst, I considered implementing it as a self-contained website. The advantages would be (1) ease of use, and (2) more features. In contrast, psst is a simpler design, so simple that the entire system fits on two pa
9.
by Sjlver 3y ago
One can use any finite field. GF(256) is popular, since it allows computers to split one byte at a time. Plus, there are many implementations of GF(256) operations, since the same field is also used in AES. In GF(256), the addition operatio
10.
by Sjlver 12y ago
This ranking uses a method called Borda Count ( https://en.wikipedia.org/wiki/Borda_count ). It can lead to quite arbitrary results, for a number of reasons. One example is that being 9th is three times better than being