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.

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.

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.

Filter by:

Quantum Computing Threat: An Overview of Post-Quantum Cryptography

The goal of this document is to provide the reader with an understanding of the key technical ideas used in post‐quantum cryptography.

Quantum Computing Threat: The First NIST Post-Quantum Cryptographic Standards

In 2016, the National Institute of Standards and Technology (NIST) launched a open and world‐ wide effort to propose, analyze and eventually standardize post‐quantum cryptographic schemes. In this white paper we find out more.

Scalable Ciphertext Compression Techniques for Post-quantum KEMs and Their Applications

A multi-recipient key encapsulation mechanism, or mKEM, provides a scalable solution to securely communicating to a large group.

The design of scalar AES Instruction Set Extensions for RISC-V

We survey the state-of-the-art industrial and academic ISEs for AES, implement and evaluate five different ISEs, one of which is novel.

Building a Modern TRNG: An Entropy Source Interface for RISC-V

The currently proposed RISC-V True Random Number Generator (TRNG) architecture breaks with previous ISA TRNG practice by splitting the Entropy Source (ES) component away from cryptographic PRNGs into a separate interface, and in its use of polling. We describe the interface, its use in cryptography, and offer additional discussion, background, and rationale for various aspects of it.

ModFalcon: Compact Signatures Based On Module-NTRU Lattices

We introduce a new family of signature schemes based on the falcon design, which relies on module lattices. Our concrete instantiation enjoys the compactness and efficiency of falcon, and allows an intermediate security level.

Cryptographic Divergences: New Techniques and New Applications

In the recent years, some security proofs in cryptography have known significant improvements by replacing the statistical distance with alternative divergences.

Mobile Energy Requirements of the Upcoming NIST Post-Quantum Cryptography Standards

We present an energy requirement analysis based on extensive measurements of PQC candidate algorithms on a Cortex M4 - based reference platform.

Post-Quantum Ciphertext Compression and Applications to Secure Group Messaging

A standard method to establish secure communications between two or more parties is to encrypt a common session key via a key encapsulation mechanism (or KEM).

Secure Update Propagation via Set-Homomorphic Signatures

In this document, we propose to use homomorphic signatures to maintain a consistent database across all nodes of distributed network.

Pyjamask: Block Cipher and Authenticated Encryption with Highly Efficient Masked Implementation

This paper introduces Pyjamask, a new block cipher family and authenticated encryption proposal submitted to the NIST lightweight cryptography standardization process.

Integral Matrix Gram Root and Lattice Gaussian Sampling Without Floats

In this paper, we give techniques to implement Gaussian sampling over general lattices without using FPA. To this end, we revisit the approach of Peikert, using perturbation sampling.