EUVD-2024-29389

Malicious code in bioql PyPI...

EUVD-2025-12394

Malicious code in bioql PyPI...

EUVD-2021-9924

Malicious code in bioql PyPI...

EUVD-2024-26896

Malicious code in bioql PyPI...

EUVD-2024-1034

Malicious code in bioql PyPI...

EUVD-2025-25658

Malicious code in bioql PyPI...

EUVD-2023-44380

Malicious code in bioql PyPI...

EUVD-2024-46417

Malicious code in bioql PyPI...

EUVD-2025-25659

Malicious code in bioql PyPI...

EUVD-2024-52308

Malicious code in bioql PyPI...

EUVD-2025-6671

Malicious code in bioql PyPI...

EUVD-2023-54648

Malicious code in bioql PyPI...

EUVD-2025-16528

Malicious code in bioql PyPI...

EUVD-2022-43895

Malicious code in bioql PyPI...

A Quantum-Secure Voting Framework Using QKD, Dual-Key Symmetric Encryption, and Verifiable Receipts

Electronic voting systems face growing risks from cyberattacks and data breaches, which are expected to intensify with the advent of quantum computing. To address these challenges, we introduce a quantum-secure voting framework that integrates Quantum Key Distribution QKD, Dual-Key Symmetric...

Quantum Resistance and Coding for a Post-Quantum Bitcoin

Bitcoin was created with strong cryptography, based on mathematical problems so complex that even the most powerful computers…...

Computational Monogamy of Entanglement and Non-Interactive Quantum Key Distribution

Quantum key distribution QKD enables Alice and Bob to exchange a secret key over a public, untrusted quantum channel. Compared to classical key exchange, QKD achieves everlasting security: after the protocol execution the key is secure against adversaries that can do unbounded computations. On th...

Probeless Vs Probe-Based Variable-Strength Eavesdropping in Quantum Key Distribution

Quantum key distribution QKD is a provably secure way of generating a secret key, which can later be used for encoding and decoding information. In this paper we analyze the effects of an eavesdropper's variable-strength measurements on QKD. Two types of measurements have been considered: i a...

On the Limitations of Pseudorandom Unitaries

Pseudorandom unitaries PRUs, one of the key quantum pseudorandom notions, are efficiently computable unitaries that are computationally indistinguishable from Haar random unitaries. While there is evidence to believe that PRUs are weaker than one-way functions, so far its relationship with other...

Mapping Quantum Threats: An Engineering Inventory of Cryptographic Dependencies

The emergence of large-scale quantum computers, powered by algorithms like Shor's and Grover's, poses an existential threat to modern public-key cryptography. This vulnerability stems from the ability of these machines to efficiently solve the hard mathematical problems - such as integer...