Subscribe via RSS

Feed URL

// what it looks like

1. 25 April 2026

   FrodoKEM: The Conservative Rock in the Storm of Post-Quantum Cryptography

   Introduction Post-quantum cryptography operates under an immense efficiency imperative. Keys must be small, computations fast, protocols lean. Algorithms that fail to meet these requirements had little chance in NIST's standardisation competition – and so ML-KEM (Kyber) emerged as the primary standard for quantum-safe key encapsulation: compact, fast, elegant. But there is one algorithm that deliberately resists this efficiency imperative. Not out of indifference, but out of conviction. FrodoKEM is the answer to a question that is easily lost in the enthusiasm surrounding structured lattice schemes: What if we are wrong? What if the algebraic structure that makes ML-KEM so efficient one day becomes its weakness? What if a cryptanalytic breakthrough shakes the security assumptions of Ring-LWE or Module-LWE – just as Shor once shook RSA and ECC? FrodoKEM gives a clear answer to this question: it completely foregoes algebraic structure, accepts larger keys and slower computations in return – and buys itself a level of security confidence grounded in one of the most thoroughly studied problems in lattice cryptography. It is not a compromise. It is a philosophy.

2. 14 April 2026

   Beyond Key Escrow: Lattice-Based Registration-Based Encryption and the Paradigm Shift in PKI

   The debate about replacing classical public-key infrastructures is as old as PKI itself. Too complex, too error-prone, too dependent on certificate chains that break under pressure – these are not new criticisms. Yet the alternatives that have emerged over the past decades have mostly shifted the dilemma rather than solved it. Identity-Based Encryption (IBE) buys its elegant simplicity at the cost of a structural security problem that is unacceptable in high-security scenarios: key escrow. A central authority holds every private key in the system – whoever compromises that authority compromises everything. A new paper by Zhang et al. (2026) now makes good on an approach that cuts through this Gordian knot without creating new ones: Registration-Based Encryption (RBE). What has long been considered theoretically promising but practically infeasible is, through a combination of lattice cryptography, homomorphic encodings, and a novel compression technique, lifted into the realm of real-world applicability for the first time – and with post-quantum security. If you're wondering what this looks like in practice and whether you can explore the mechanics yourself in the browser: yes, you can. The interactive RBE page on this site walks you through the paradigm step by step - from client-side key generation through registration with the Key Curator (KC) and the helper decryption key to two-stage decryption. The demo is a didactic simplification: it reproduces the essential properties faithfully (the KC sees no secret key, identity binding is enforced in the ciphertext, decryption is sublinear in the user identity), but uses deliberately reduced parameters and a Ring-LWE construction in place of the paper's full gadget-matrix machinery - so each step stays well under a second in the browser and the core idea doesn't get lost behind 236×1024 matrices and Gaussian sampling.

3. 8 March 2026

   FIPS 203: ML-KEM in Focus – Technical Foundations and Practical Implications for the Post-Quantum Era

   Why FIPS 203 is a Game-Changer On August 13, 2024, NIST set a milestone with the publication of FIPS 203: The Module-Lattice-Based Key-Encapsulation Mechanism (ML-KEM) is now officially standardized—marking the transition from PQC research to operational practice. For security architects, developers, and compliance officers, this begins the concrete planning phase. This article analyzes the core technical mechanisms, performance trade-offs, and migration strategies you need to consider today.