This work presents an architecture and implementation for hybrid, QES-shaped PAdES that embeds a FIPS 204 ML-DSA-65 signature as an RFC 9882 CMS SignedData counter-signature in the unsignedAttrs of a classical ECDSA-P256 PAdES signature, and maps it to eIDAS 2.0, ETSI and CEN and state its limitations.
Abstract
Qualified electronic signatures (QES) under eIDAS rely almost exclusively on classical elliptic-curve or RSA algorithms, which a cryptographically relevant quantum computer (CRQC) would break, exposing signed documents to harvest-now-forge-later attacks, yet operators cannot abandon the algorithms that confer legal validity. We present an architecture and implementation for hybrid, QES-shaped PAdES that embeds a FIPS 204 ML-DSA-65 signature as an RFC 9882 CMS SignedData counter-signature in the unsignedAttrs of a classical ECDSA-P256 PAdES signature. Because RFC 5652 excludes unsignedAttrs from the classical signature, an unmodified EU DSS 6.3 validator provisioned with the issuing CA reports TOTAL-PASSED while the post-quantum layer remains independently verifiable; a three-component binding ties the two layers against mix-and-match and transplantation, and an independent validator fails closed if it cannot be reconstructed. On a running deployment we demonstrate DSS validation, tamper detection and PAdES-BASELINE-LTA support: a hundred-run SCAL2 ceremony medians ≈ 270 ms (p95 ≈ 364 ms), a size sweep resolves signing cost into a fixed ≈4.9 ms term plus ≈3.5 ms/MB, and a ten-run paired comparison isolates a ≈229 ms (≈79%) increment, with no size overhead beyond reserved capacity. We map it to eIDAS 2.0, ETSI and CEN and state its limitations, including a software module rather than a certified QSCD.
The migration from classically secure key agreement to post-quantum cryptography (PQC) is now a practical engineering problem rather than a distant theoretical one and anonymity networks face a particularly acute version of it. Traffic captured today on the Tor network can be archived and decrypted years later once a c...
Subhash Kumar, K. Kolhe· International Conference on...· 0 citations
The prospect of a cryptographically relevant quantum computer (CRQC) undermines the public-key primitives that secure virtually every layer of modern communication networks, from subscriber authentication in cellular cores to transport-layer key exchange. Adversaries already following a harvest-now, decrypt-later (HNDL...
The prospective arrival of a cryptanalytically relevant quantum computer (CRQC) threatens the asymmetric primitives that protect smart grid communications, protection signalling and identity assertions. Migration to the NIST-standardised post-quantum cryptography (PQC) suite — ML-KEM (FIPS 203) and ML-DSA (FIPS 204) —...
Gulab Kumar Mondal, Dharampal Singh, Arijit Das et al.· JOURNAL OF MECHANICS OF CONT...· 0 citations
Results demonstrate that, compared with standalone ECDHE-P256 and standalone ML-KEM-768, the proposed hybrid framework introduces only minimal computational overhead while maintaining stable resource utilization, indicating that the integration of classical and post-quantum cryptographic mechanisms does not constitute...
W. Maya, Teuku Yuliar Arif, Hammam Riza et al.· IEEE Access· 0 citations
Post-quantum cryptographic standardization is complete for the algorithms that matter most, yet adoption across financial infrastructure remains uneven and, in critical segments, largely absent. This paper argues that migration is no longer a research question but an execution question, and that the window for orderly...
Maria Teigeiro· Proceedings of the Internati...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.