remcob

7 ms·

31.
by remcob 5y ago
In my experience Rust has become the go-to language for applied cryptography and is becoming increasingly popular for embedded/iot development. We're currently hiring for both and experience a scarcity of developers.
32.
by remcob 5y ago
LLVM (Rusts' backend) doesn't support the Xtensa instruction set, which makes this so complicated. The newer ESP32-C{3,6} instead use a RISC-V instruction set which is already supported by Rust, so its much easier to set up. So fa
33.
by remcob 5y ago
It's the 'one-electron universe' theory [0]. In short: there is one electron that keeps going back and forth in time to play the role of every electron we see. A particle 'going backwards in time' is mathematically
34.
by remcob 5y ago
What's the current best alternative for boat dwellers?
35.
by remcob 5y ago
Lyra is also a speech-only codec, yet is included in the comparison. Note also that Codec2 had some experimental work extending it with the WaveNet neural network, which improved the performance. Given both of this, it seems disingenuous to
36.
by remcob 5y ago
Could that radiative energy be turned into propulsion, at least theoretically?
37.
by remcob 5y ago
I use brackets with a subscript as notation for the modulo operation. This way expressions with multiple / nested moduli become much more readable. I'm particularly fond of how concisely the Chinese Remainder Theorem can be stated
38.
by remcob 6y ago
IIRC, I tried this method, but did not see any performance improvement. The method replaces a single `divq` instruction with a table lookup and several multiplications. On modern processors this is no longer a worthwhile trade off.
39.
by remcob 6y ago
Here is my optimized in-place Rust implementation [1]. It is a very tricky algorithm to get right. There are many edge cases that only happen for ~2^-64 fractions of the input space, so hard to find even with fuzz-testing. Best strategy is
40.
by remcob 6y ago
> using a hash of the ID Hashing the IDs won't solve their lack of entropy. Crude example: If you hash your pincode I still have only 10^4 values to try. The easiest way to fix this is to add an access token column that is cryptogra
41.
by remcob 6y ago
> No, I cannot adequately explain why the hyphen moves. Draw your own conclusions. The hyphen is there because ZK-SNARKs are a subset of SNARKs. Where a general SNARK may leak some or all of the knowledge as part of the proof, a ZK-SNARK
42.
by remcob 6y ago
For every lucky person making $500k there are 100 people loosing $5k.
43.
by remcob 6y ago
I put the speed of sound purely as a comparison. The local speed of sound is irrelevant because the dust was moving with the medium and not relative to the medium.
44.
by remcob 6y ago
Napkin math: That column of dirt went up ~20 km in about 30 seconds. That's almost twice the speed of sound. Incredible how its size makes it look slow.
45.
by remcob 6y ago
This optimization problem is very similar to that of minimizing the diagonal bandwidth of a matrix, a common problem in large numerical computations [1]. It is also related to cluster finding in graphs and graph layouts by considering the a
46.
by remcob 6y ago
With a one-off precomputation you can do a lot. If you store the distance to exit in each cell you can introduce a slight bias towards the exit. Easy to implement but not very realistic since it assumes things the guests can not know. More
47.
by remcob 6y ago
Those are valid examples, but modules are much older than that: https://en.wikipedia.org/wiki/Modular_programming#History It really shows Stroustrup's point on how most of these programming concepts have been arou
48.
by remcob 6y ago
This depends on your exact definition of an FHE computation. You could imagine a definition under which you can consider the whole scheme a single Turing complete FHE. But this definition would have to accept that the FHE computation is unb
49.
by remcob 6y ago
Imagine a FHE circuit that executes a single webassembly instruction. This is a finite circuit that takes as input the program, machine state and external input (all encrypted). As output it returns the (encrypted) new machine state and a s
50.
by remcob 6y ago
Would you consider elliptic curve cryptography conceptually difficult? It's certainly more complex than RSA, but over time great educational resources have been developed. The same will happen for these post-quantum schemes.
51.
by remcob 6y ago
A conjecture is a proposition that is suspected to be true. So there would be no proof in the paper, but likely some arguments why the authors expect it to be true.
52.
by remcob 6y ago
> wish there was a brain cleaning solution 'Drug-induced amnesia' to reduce long term memory generation is a thing and is sometimes used before traumatic surgical procedures. It needs to be taken in advance and is probably not
53.
by remcob 6y ago
Indeed, understand-ability is a double-edged sword in cryptography. In general it's best to follow Kerckhoffs's principle and make sure you understand why it works, or risk that your adversary learns more than you do. > Quantum
54.
by remcob 6y ago
There's a big difference between symmetric and public key cryptography when it comes to this sort of explainability. Public key cryptography like RSA, Elliptic Curves and Lattices have elegant mathematical theories behind them. Learnin
55.
by remcob 6y ago
I tried cache-oblivious algorithms for some numerical code, but found them underwhelming. The cache-oblivious model does not consider the effects of prefetching and cache line associativity. Both can make a huge difference. They are a great
56.
by remcob 6y ago
As a typography and Polish enthusiast, it bugs me that "Zloty" is not spelled "Złoty" with an 'ł'.
57.
by remcob 6y ago
It has current practical applications in inter-bank fraud detection, where you want to query if someone is on someone else's blacklist but not reveal the blacklist or the person being queried. These applications can easily handle an 80
58.
by remcob 6y ago
In homomorphic systems the server only sees the encrypted result. Since it can not decrypt it, it doesn't gain any information from it. And indeed the encryption is scrambled differently for each query, otherwise you could learn if two
59.
by remcob 6y ago
You should compare them to what the performance numbers where 5 and 10 years ago. Homomorphic crypto systems have become many orders of magnitude faster quite rapidly. While they are still no where near non-homomorphic solutions (and likely
60.
by remcob 6y ago
I was oversimplifying to convey an intuition on why this is so hard. But yes, this is an active area of research. In this academic field the standard for privacy is usually extremely high. Even if you only access half of the rows, that stil

More ›