Post-Quantum Lattice-Based Cryptographic Schemes for Long-Term Data-at-Rest Protection in Enterprise Database Systems

Enterprise databases store sensitive financial, healthcare, genomic, and governmental records requiring long-term confidentiality. However, quantum computing threatens conventional RSA and elliptic-curve cryptography through Shor’s algorithm, while harvest-now-decrypt-later attacks expose encrypted archives to future decryption. This paper proposes a lattice-based post-quantum envelope-encryption architecture that replaces conventional key-wrapping mechanisms in transparent data encryption (TDE) systems while preserving AES-256 bulk encryption. The framework integrates a hybrid Module-Lattice-Based Key-Encapsulation Mechanism (ML-KEM) and classical cryptographic combiner, Module-Lattice-Based Digital Signature Algorithm (ML-DSA) or Falcon Digital Signature Algorithm (FN-DSA) authentication, hash-chained audit logging, and policy-driven cryptographic agility. Seven algorithms support hybrid encapsulation, decapsulation, enterprise rekeying, audit verification, mode negotiation, and exposure-aware migration scheduling. An analytical performance model estimates a 9% latency increase per hybrid key-rewrapping operation, reaching 12% at the highest security level. Parallel processing reduces the projected rekeying time for ten million keys from over ten hours to under ninety seconds using 512 workers. A ten-year ML-DSA-authenticated audit trail across 1,000 tenants requires approximately 400 MB, compared with approximately 100 MB using FN-DSA. Four case studies covering financial, healthcare, genomic, and multinational systems demonstrate computationally feasible migration within one hour. Without migration, long-retention records face estimated residual exposure periods of 41–57 years under Mosca’s inequality. The findings indicate that cryptographic key management, rather than computational migration costs, represents the primary challenge in protecting enterprise databases against quantum threats. Future work includes hardware security module integration, constant-time implementations, and empirical validation under operational enterprise workloads.

Authors

Institutions

Publication Details

Journal
STAP Journal of Security Risk Management
Published
2026-11-03
DOI
https://doi.org/10.63180/jsrm.thestap.2026.1.9
Primary Topic
Cryptography and Data Security
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Post-Quantum Lattice-Based Cryptographic Schemes for Long-Term Data-at-Rest Protection in Enterprise Database Systems

Haider H. Razzaq
STAP Journal of Security Risk Management
Cryptography and Data Security
article

Post-Quantum Lattice-Based Cryptographic Schemes for Long-Term Data-at-Rest Protection in Enterprise Database Systems

Haider H. Razzaq
article en

Abstract

Enterprise databases store sensitive financial, healthcare, genomic, and governmental records requiring long-term confidentiality. However, quantum computing threatens conventional RSA and elliptic-curve cryptography through Shor’s algorithm, while harvest-now-decrypt-later attacks expose encrypted archives to future decryption. This paper proposes a lattice-based post-quantum envelope-encryption architecture that replaces conventional key-wrapping mechanisms in transparent data encryption (TDE) systems while preserving AES-256 bulk encryption. The framework integrates a hybrid Module-Lattice-Based Key-Encapsulation Mechanism (ML-KEM) and classical cryptographic combiner, Module-Lattice-Based Digital Signature Algorithm (ML-DSA) or Falcon Digital Signature Algorithm (FN-DSA) authentication, hash-chained audit logging, and policy-driven cryptographic agility. Seven algorithms support hybrid encapsulation, decapsulation, enterprise rekeying, audit verification, mode negotiation, and exposure-aware migration scheduling. An analytical performance model estimates a 9% latency increase per hybrid key-rewrapping operation, reaching 12% at the highest security level. Parallel processing reduces the projected rekeying time for ten million keys from over ten hours to under ninety seconds using 512 workers. A ten-year ML-DSA-authenticated audit trail across 1,000 tenants requires approximately 400 MB, compared with approximately 100 MB using FN-DSA. Four case studies covering financial, healthcare, genomic, and multinational systems demonstrate computationally feasible migration within one hour. Without migration, long-retention records face estimated residual exposure periods of 41–57 years under Mosca’s inequality. The findings indicate that cryptographic key management, rather than computational migration costs, represents the primary challenge in protecting enterprise databases against quantum threats. Future work includes hardware security module integration, constant-time implementations, and empirical validation under operational enterprise workloads.

STAP Journal of Security Risk ManagementVol. 2026(1)
Mustansiriyah University (IQ)
Openalex Percentile: Top 16%
Cryptography and Data 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
Post-Quantum Lattice-Based Cryptographic Schemes for Long-Term Data-at-Rest Protection in Enterprise Database Systems — Haider H. Razzaq · STAP Journal of Security Risk Management (2026) | TGRS Research Map | TGRS