Posts
The Futility of Lava Lamps: What Random Really Means
Try to prove that my denial protocol doesn't work
*A few weeks ago I started building a post-quantum encryption library. One of the protocols, which I called BLUE, is supposed to give built-in plausible deniability.* *I've been thinking about deniability for a while. I've seen VeraCrypt and it's great, but it's mostly "physical." I wanted something easily implementable in …
A new foundational method for zero knowledge proofs
Plausible deniability with chemical-key mixing, does this hold against statistical analysis?
A few weeks ago I started building a post-quantum encryption library. One of the protocols, which I called BLUE, is supposed to give built-in plausible deniability. I've been thinking about deniability for a while. I've seen VeraCrypt and it's great, but it's mostly "physical." I wanted something easily implementable in …
ECDSA: Visually Explained | Suzumi's little web corner
Hello everyone! In the last few weeks, I was trying to find a good ECDSA explanation to share with a colleague and I was surprised to find no post with an actual visual explanation for the algorithm. So that's why I decided to make this post! Obs: I really did …
Revaulter v2: encrypt/sign with Passkeys/PRF
Revaulter is an app that I've been using for 6 years to unwrap keys for unlocking my servers' HDDs and for performing backups. A CLI creates requests, then a user can sign into a web page and use web-based crypto to execute the operation (encryption or signing), before relying the …
At 18, Ewin Tang wrecked the field of quantum machine learning
In the 2010s, there was considerable interest in and VC funding for quantum algorithms for machine learning, based largely upon the Kerenidis and Prakash quantum recommendation system. [Ewin Tang undergrad project](https://arxiv.org/abs/1807.04271) de-quantized this algorithm, effectively killing the field of quantum machine learning (QML). Her PhD work de-quantized many of the …
Walsh criteria for Boolean functions as spectral sectors of one graph?
I noticed a possible connection between the standard Walsh conditions for Boolean functions and the spectrum of one finite graph. In Boolean-function cryptography, balancedness, correlation immunity, and resilience are usually checked through the vanishing of low-weight Walsh coefficients. So the construction below is about the low-weight Walsh layers. I tried …