Dear Sentinels

Another week, another post, aren't you lucky! 😁

This time, we're diving into the world of the Internet of Things (IoT) and Field-Programmable Gate Arrays (FPGAs), all through the lens of Post-Quantum Cryptography (PQC). Yes, that's quite a lot to chew on, but stick with me; it gets less intimidating, I promise. The gist is that post-quantum cryptography, especially the lattice-based kind, is being cooked up to keep our secrets safe from both regular and quantum computers. Quantum computing, as you may have heard, is threatening to turn our current cryptographic favourites like RSA and ECC into little more than historical curiosities, thanks to algorithms like Shor's. So, time to future-proof!

Lattice-based cryptography is all about mathematical problems that even quantum computers are expected to find a bit too spicy to handle. These clever constructions are the rising stars of PQC, promising security for everything from encryption to digital signatures and key exchange. Sure, traditional processors might grumble about the extra maths, but that's the price of keeping our secrets safe in the quantum future.

But before we get tangled up in all that, let's have a quick look at what the web has brought for us this week:

News from around the web!

FPGA Frontrunner Event

What is FPGA?

Oh Memories, Where'd You Go

Passkeys are Your New Best Friend

A year of open source vulnerability trends: CVEs, advisories, and malware

Will ChatGPT Replace Me?

Ready to transform artificial intelligence from a buzzword into your personal revenue generator?

HubSpot’s groundbreaking guide "200+ AI-Powered Income Ideas" is your gateway to financial innovation in the digital age.

Inside you'll discover:

Download your guide today and unlock a future where artificial intelligence powers your success. Your next income stream is waiting.

Get Your Guide

The digital world as we know it is built on a foundation of mathematical puzzles that, for now, leave our computers scratching their metaphorical heads. Enter quantum computing, stage left, ready to cause a bit of a headache for everyone relying on current cryptography. These quantum machines could, in theory, make short work of our favourite codes, so post-quantum cryptography is no longer just a fun academic exercise, it's a must-have if we want to keep our digital secrets safe. This is especially true for governments and anyone with data they'd rather not see on the front page of the Daily Mail in ten years' time. The answer? We're moving away from the old maths and embracing new frameworks, with lattices leading the charge.

At first glance, a lattice just looks like a bunch of dots in a neat pattern, hardly the stuff of cryptographic legend. But don't be fooled; beneath that innocent exterior lies a world of mathematical mischief. In maths-speak, a lattice is built from basis vectors, which you can imagine as arrows starting from the centre and pointing off in various directions. Stack them, flip them, or line them up like dominoes, and you can reach any dot in the pattern. The trick is, you can only use whole numbers, no sneaky fractions allowed. This is what gives lattices their 'hardness' and makes them so useful for keeping secrets.

Here's where it gets sneaky: you can use two completely different sets of basis vectors to make exactly the same lattice. For example, a nice, tidy square lattice can be made with the simple (1,0) and (0,1), or you can get fancy and use (7,3) and (2,1), same result, just more maths homework. While it's not too hard to wrap your head around in two dimensions, try imagining it in seventeen or even a hundred dimensions. Suddenly, it's less 'connect the dots' and more 'good luck finding your way out of this maze'. This complexity is exactly what makes lattices such a tough nut to crack for would-be codebreakers.

The real magic of lattice-based cryptography comes down to two fiendish puzzles: the Shortest Vector Problem (SVP) and the Closest Vector Problem (CVP). These aren't just maths brainteasers, they're the main reason your secrets stay secret. The SVP asks you to find the lattice point nearest to the centre, but not the centre itself. Easy in two dimensions, but as you add more, the number of possibilities explodes faster than my inbox after a deadline. Even the fastest computers, quantum or otherwise, are left floundering when the dimensions hit triple digits.

The CVP is just as tricky: find the lattice point closest to some random spot that isn't even on the grid. Good luck with that! Experts reckon these problems are so stubborn that even quantum computers will have to admit defeat, which is why they're perfect for keeping our data safe. The sheer amount of time it would take to brute-force a solution in these high-dimensional spaces is enough to make any hacker give up and go for a cup of tea instead.

So, how does all this maths actually keep your emails safe? It comes down to a clever trick: the private key makes a hard problem easy for you, but leaves everyone else stuck. This is done by choosing between 'good' and 'bad' bases. A good basis has vectors that are almost at right angles, making the maths a doddle. A bad basis, on the other hand, has vectors nearly on top of each other, so finding the right point is like searching for a needle in a haystack, blindfolded.

Picture this: Alice, ever the diligent cryptographer, sets up a lattice and keeps the 'good' basis tucked away as her private secret, while generously sharing the 'bad' basis with the world. Along comes Bob, who wants to send a message. He picks a lattice point to represent his data, then gives it a little nudge, just a short wiggle away, to introduce a deliberate error. The result? A new point in space, and a bit of mathematical mischief. Thanks to her secret good basis, Alice can effortlessly undo Bob's creative detour and recover the original message. The early GGH encryption scheme was the first to try this trick, but unfortunately, clever researchers found a shortcut and cracked the secret. As a result, the cryptographic community has moved on to sturdier territory, namely the Learning with Errors (LWE) problem. LWE keeps the geometric fun but adds enough security to keep even the nosiest mathematicians at bay.

Lattice-based cryptography has come a long way from its days as a mathematical curiosity. Now, thanks to the National Institute of Standards and Technology (NIST), it's getting the full treatment as a global security standard. This is where abstract geometry meets the real world of FIPS-certified government systems, no pressure, then. The star of the show is ML-KEM (you might remember it as Kyber), which is set to be finalised this year and will help us all move our key establishment mechanisms into the quantum era. Not to be outdone, digital signatures are also getting their moment in the spotlight, with ML-DSA (formerly Dilithium and Falcon) joining the standards parade.

Rolling out these new standards is no small feat, it means swapping out the old cryptographic kit for shiny new lattice-based mechanisms. Organisations everywhere will need to prepare for the great migration, moving from trusty elliptic curve Diffie-Hellman (ECDH) to the brave new world of Key Encapsulation Mechanisms. The new tools come in a few flavours: ML-KEM and ML-DSA stick with structured lattices, while Falcon takes a slightly different route, just to keep attackers (and cryptographers) on their toes. As these standards settle in, they promise a security posture that can stand up to quantum computers, at least until someone invents a quantum-powered abacus. In the end, we've gone from simple dot patterns to a high-dimensional geometric fortress, all in the name of keeping our digital secrets safe for the quantum age.

This survey investigates the implementation of lattice-based algorithms as a robust solution for securing energy-constrained Internet-of-Things (IoT) devices against emerging threats from advanced quantum computing architectures. The analysis highlights that lightweight lattice-based cryptography delivers high concurrent performance and parallelism while maintaining resistance to quantum attack vectors that compromise classical asymmetric cryptographic primitives.

The rapid advancement of quantum computers presents a significant threat to modern cybersecurity, as these machines can solve complex mathematical equations far more efficiently than traditional computing systems. Most current public-key algorithms depend on factoring or discrete logarithm problems, both of which are susceptible to Shor’s algorithm when executed on logical qubits. As a result, there is an urgent need for post-quantum cryptography (PQC) capable of operating within existing real-time infrastructures while maintaining stability against powerful quantum machines.

Lattice-based cryptography has emerged as a leading candidate for this transition because it utilises n-dimensional vector spaces with periodic structures that are computationally difficult to solve. These algorithms offer security grounded in worst-case intractability assumptions, rendering them resistant to attack vectors employed by quantum hardware. Implementing these methods necessitates careful simplification into lightweight lattice-based cryptography to ensure compatibility with the limited resources of IoT hardware.

Post-quantum lattice-based algorithms are particularly well-suited for mission-critical infrastructures, including medical systems, surveillance, space exploration, and next-generation 5G/NB-IoT communication networks. These schemes rely on linear algebra-based matrix operations on integers, providing efficiency that aligns with the narrow bandwidth and low-power requirements of edge nodes. Variants such as Saber and ThreeBears have been identified as optimal candidates for lightweight implementation due to their reduced communication bandwidth requirements.

In practical hardware environments, these algorithms are implemented on platforms such as ARM Cortex-M microcontrollers, Field Programmable Gate Arrays (FPGAs), and Application-Specific Integrated Circuits (ASICs) to enable identity-based or fully homomorphic encryption. To optimise performance for IoT devices such as Raspberry Pi, developers substitute large matrices with polynomials in integer rings, thereby minimising storage and computation time. This strategy facilitates secure machine-to-machine communication and supports electric vehicle charging infrastructure without exceeding the memory and battery limitations of dense sensor networks.

Although lightweight lattice-based cryptography demonstrates significantly higher speeds than classical approaches, further research is necessary to optimise these algorithms for industrial IoT and dense machine-to-machine environments. Researchers are currently developing advanced hardware designs based on Number Theoretical Transformation (NTT) to reduce energy consumption while maintaining high security levels. Future investigations must address the risk of side-channel attacks and ensure that the scalability of lattice cryptography meets the requirements of operational technology in dense sensor networks.

The report can be found here.