Enhancing BIKE with physical unclonable functions for post-quantum cryptography

The growing capabilities of quantum computers pose a serious threat to classical cryptographic systems, motivating the development of secure alternatives capable of withstanding quantum attacks. BIKE (Bit Flipping Key Encapsulation) is among the promising code-based candidates considered in the post-quantum cryptography (PQC) standardization process. Despite its efficiency, BIKE’s conventional key generation process relies on software-based pseudo-random number generators (PRNGs), which remain susceptible to weak entropy sources and side-channel-based seed recovery. In this work, we present an enhanced version of BIKE that binds key generation to device-specific runtime characteristics through a lightweight, PUF-inspired CPU fingerprinting mechanism. The proposed method derives entropy from CPU utilization, runtime power telemetry, memory-access latency, and hardware identifiers to construct a device-specific cryptographic seed. Unlike conventional silicon PUFs such as SRAM or Ring Oscillator PUFs, this approach requires no dedicated hardware circuitry, making it applicable to resource-constrained and commodity computing platforms. The derived response is stabilized using a BCH-based fuzzy extractor to ensure consistent key reconstruction across runtime conditions, and the resulting seed is used to generate BIKE’s sparse cryptographic polynomials through a constant-time construction procedure. By reducing reliance on software-generated PRNG seed material, the proposed approach improves resistance to seed-prediction, seed-reuse, and seed-exposure threats within a software-observable threat model, while preserving compatibility with BIKE’s standard structure. Experimental evaluation using NIST, DIEHARD, and TestU01 statistical test suites confirms the high randomness quality of the generated keystream, and timing-based analysis indicates constant-time behavior in the core polynomial-generation routines. These results position the proposed approach as a practical, hardware-informed enhancement to BIKE’s key generation process for lightweight and embedded post-quantum applications.

Authors

Institutions

Publication Details

Journal
Cluster Computing
Published
2026-11-21
DOI
https://doi.org/10.1007/s10586-026-06654-0
Primary Topic
Physical Unclonable Functions (PUFs) and Hardware Security
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Enhancing BIKE with physical unclonable functions for post-quantum cryptography

Ahmed Shalaby, Noha Abd-ElKareem, Mazen Selim
Cluster Computing
Physical Unclonable Functions (PUFs) and Hardware Security
article

Enhancing BIKE with physical unclonable functions for post-quantum cryptography

Ahmed Shalaby, Noha Abd-ElKareem, Mazen Selim
article en

Abstract

The growing capabilities of quantum computers pose a serious threat to classical cryptographic systems, motivating the development of secure alternatives capable of withstanding quantum attacks. BIKE (Bit Flipping Key Encapsulation) is among the promising code-based candidates considered in the post-quantum cryptography (PQC) standardization process. Despite its efficiency, BIKE’s conventional key generation process relies on software-based pseudo-random number generators (PRNGs), which remain susceptible to weak entropy sources and side-channel-based seed recovery. In this work, we present an enhanced version of BIKE that binds key generation to device-specific runtime characteristics through a lightweight, PUF-inspired CPU fingerprinting mechanism. The proposed method derives entropy from CPU utilization, runtime power telemetry, memory-access latency, and hardware identifiers to construct a device-specific cryptographic seed. Unlike conventional silicon PUFs such as SRAM or Ring Oscillator PUFs, this approach requires no dedicated hardware circuitry, making it applicable to resource-constrained and commodity computing platforms. The derived response is stabilized using a BCH-based fuzzy extractor to ensure consistent key reconstruction across runtime conditions, and the resulting seed is used to generate BIKE’s sparse cryptographic polynomials through a constant-time construction procedure. By reducing reliance on software-generated PRNG seed material, the proposed approach improves resistance to seed-prediction, seed-reuse, and seed-exposure threats within a software-observable threat model, while preserving compatibility with BIKE’s standard structure. Experimental evaluation using NIST, DIEHARD, and TestU01 statistical test suites confirms the high randomness quality of the generated keystream, and timing-based analysis indicates constant-time behavior in the core polynomial-generation routines. These results position the proposed approach as a practical, hardware-informed enhancement to BIKE’s key generation process for lightweight and embedded post-quantum applications.

Cluster ComputingVol. 30(1)
Benha University (EG), Egypt-Japan University of Science and Technology (EG), Delta University for Science and Technology (EG)
Physical Unclonable Functions (PUFs) and Hardware Security
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon