Publications

0
Peer-Reviewed
Papers
0
Further NIST PQC
Submissions
0
NIST PQC Standards
Co-Authored
0
Patents in
Process
0
Mature Products
Developed
0
Best Paper
Awards
SPOTLIGHT PUBLICATION | 17/09/2025

PQC vs. QKD: What Matters Now and What Can Wait

In this episode of Shielded, we talk with Will Collison, Interim Global Head of Cryptography at HSBC. Will explains how to separate PQC, QKD, and quantum computing, and why cryptographic agility is the real objective.
| 11/09/2025
3, 5 or 8 Years? The Realistic Timeline for Migration and the Task That Can’t Wait
What if quantum computing feels like a distant threat, but your timeline to prepare is already running out? We welcome Adrian Neal, Senior Director and Global Lead for Post-Quantum Cryptography at Capgemini.
| 26/06/2025
The Crypto Agility Paradox: When Hardware Becomes Your Security Bottleneck
In this episode of Shielded, we are joined by Cassie Crossley, Vice President of Supply Chain Security in the Global Cybersecurity & Product Security Office at Schneider Electric. Cassie shares the hard-earned lessons from a multi-year crypto agility program in one of the world’s largest OT environments.
| 02/05/2023
A Key-Recovery Attack Against Mitaka in the t-Probing Model
We uncover a flaw in the security proof of MITAKA, and subsequently show that it is not secure in the t-probing model.
| 02/05/2023
Zero-Knowledge Arguments for Subverted RSA Groups
This work investigates zero-knowledge protocols in subverted RSA groups where the prover can choose the modulus and where the verifier does not know the group order.
| 01/05/2023
Area–Time Efficient Implementation of NIST Lightweight Hash Functions Targeting IoT Applications
This work presents field-programmable gate array (FPGA) implementations and carefully worked out optimizations of four Round-3 finalists in the NIST standardization process
| 23/03/2023
A 334 μW 0.158 mm² ASIC for Post-Quantum Key-Encapsulation Mechanism Saber With Low-Latency Striding Toom–Cook Multiplication
We demonstrate that a memory-efficient striding Toom–Cook with lazy interpolation results in a highly compact, low-power implementation, which, on top, enables a very regular memory access scheme.
| 29/01/2023
Comparing Key Rank Estimation Methods
Recent works on key rank estimation methods claim that algorithmic key rank estimation is too slow, and suggest two new ideas.
| 29/11/2022
RISC-V Instruction Set Extensions for Lightweight Symmetric Cryptography
The NIST LightWeight Cryptography (LWC) selection process aims to standardise cryptographic functionality which is suitable for resource-constrained devices.
| 11/11/2022
How to Hide MetaData in MLS-Like Secure Group Messaging: Simple, Modular, and Post-Quantum
Secure group messaging (SGM) protocols allow large groups of users to communicate in a secure and asynchronous manner.
| 13/10/2022
A New Framework for More Efficient Round-Optimal Lattice-Based (Partially) Blind Signature via Trapdoor Sampling
Blind signatures, proposed by Chaum (CRYPTO’82), are interactive protocols between a signer and a user, where a user can obtain a signature without revealing the message to be signed.
| 07/09/2022
Secure Messaging in a Post-Quantum World
Team PQShield experts outline how PQC can be applied to secure messaging in a two-party setting, typically between mobile devices, as well as the specific performance and data requirements.
| 09/08/2022
WiP: Applicability of ISO Standard Side-Channel Leakage Tests to NIST Post-Quantum Cryptography
We discuss how to apply ISO 17825 to hardware modules that implement lattice-based PQC standards for public-key cryptography. We find that simple “random key” vs. “fixed key” tests are unsatisfactory due to the close linkage between public and private components of PQC keypairs.
| 22/06/2022
SP 800-22 and GM/T 0005-2012 Tests: Clearly Obsolete, Possibly Harmful
NIST SP 800–22, describes 15 statistical tests and suggests that they can be used to evaluate random and pseudorandom number generators in cryptographic applications. The Chinese standard GM/T 0005–2012 describes similar tests. These documents have not aged well. The weakest pseudorandom number generators will easily pass these tests, promoting false confidence in insecure systems.
| 22/06/2022
More efficient, provably-secure direct anonymous attestation from lattices
The Cloud-Edges (CE) framework, wherein small groups of Internet of Things (IoT) devices are serviced by local edge devices, enables a more scalable solution to IoT networks.