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 | 14/08/2024

New Whitepaper: “The new NIST standards are here: what does it mean for PQC in 2024?”

Yesterday NIST published their finalized post-quantum cryptography (PQC) standards. This paper discusses the standards in more detail and what comes next.

Formally verifying Kyber Episode V: Machine-checked IND-CCA security and correctness of ML-KEM in EasyCrypt

Using computer-assisted proof tools to ensure security and correctness of Kyber and NIST-standard ML-KEM.

Post-Quantum Cryptography for Defence and Governmental Applications: Overview and Use Cases

Protecting the Military against the Quantum Threat to Today’s Cryptography.

Filter by:

BEARZ Attack FALCON: Implementation Attacks with Countermeasures on the FALCON Signature Scheme

This research proposes the first fault attack analysis of FALCON and finds its lattice trapdoor sampler is as vulnerable to fault attacks as the GPV sampler used in alternative signature schemes.

Round5: Compact and Fast Post-quantum Public-Key Encryption

We present the ring-based configuration of the NIST submission Round5, a Ring Learning with Rounding (RLWR)- based IND-CPA secure public-key encryption scheme.

More Efficient Algorithms for the NTRU Key Generation Using the Field Norm

This work shows how to speed up key generation for NTRU-based algorithms by 100x.

Anonymous Reputation Systems Achieving Full Dynamicity from Lattices

In this work, we revisit the Anonymous Reputation Systems presented by Blömer et al. in (FC’15).

Shorter Messages and Faster Post-Quantum Encryption with Round5 on Cortex M

Round5 is a Public Key Encryption and Key Encapsulation Mechanism (KEM) based on General Learning with Rounding (GLWR), a lattice problem. We implement Round5 on Cortex M4.

Attribute-Based Signatures for Unbounded Circuits in the ROM and Efficient Instantiations from Lattices

In this work, we affirmatively close the gap between ABS schemes based on bilinear maps and lattices by constructing the first lattice-based ABS scheme for unbounded circuits in the random oracle model.