Quantum Enhanced Entropy Pool for Cryptographic Applications and Proofs
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866912435972079616 |
|---|---|
| author | Njoku, Buniechukwu Biswas, Sonai Ghadimi, Milad Shojafar, Mohammad Gradoni, Gabriele Bassoli, Riccardo Fitzek, Frank H. P. |
| author_facet | Njoku, Buniechukwu Biswas, Sonai Ghadimi, Milad Shojafar, Mohammad Gradoni, Gabriele Bassoli, Riccardo Fitzek, Frank H. P. |
| contents | This paper investigates the integration of quantum randomness into Verifiable Random Functions (VRFs) using the Ed25519 elliptic curve to strengthen cryptographic security. By replacing traditional pseudorandom number generators with quantum entropy sources, we assess the impact on key security and performance metrics, including execution time, and resource usage. Our approach simulates a modified VRF setup where initialization keys are derived from a quantum random number generator source (QRNG). The results show that while QRNGs could enhance the unpredictability and verifiability of VRFs, their incorporation introduces challenges related to temporal and computational overhead. This study provides valuable insights into the trade-offs of leveraging quantum randomness in API-driven cryptographic systems and offers a potential path toward more secure and efficient protocol design. The QRNG-based system shows increased (key generation times from 50 to 400+ microseconds, verification times from 500 to 3500 microseconds) and higher CPU usage (17% to 30%) compared to the more consistent performance of a Go-based VRF (key generation times below 200 microseconds, verification times under 2000 microseconds, CPU usage below 10%), highlighting trade-offs in computational efficiency and resource demands. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_14340 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Quantum Enhanced Entropy Pool for Cryptographic Applications and Proofs Njoku, Buniechukwu Biswas, Sonai Ghadimi, Milad Shojafar, Mohammad Gradoni, Gabriele Bassoli, Riccardo Fitzek, Frank H. P. Cryptography and Security Quantum Physics This paper investigates the integration of quantum randomness into Verifiable Random Functions (VRFs) using the Ed25519 elliptic curve to strengthen cryptographic security. By replacing traditional pseudorandom number generators with quantum entropy sources, we assess the impact on key security and performance metrics, including execution time, and resource usage. Our approach simulates a modified VRF setup where initialization keys are derived from a quantum random number generator source (QRNG). The results show that while QRNGs could enhance the unpredictability and verifiability of VRFs, their incorporation introduces challenges related to temporal and computational overhead. This study provides valuable insights into the trade-offs of leveraging quantum randomness in API-driven cryptographic systems and offers a potential path toward more secure and efficient protocol design. The QRNG-based system shows increased (key generation times from 50 to 400+ microseconds, verification times from 500 to 3500 microseconds) and higher CPU usage (17% to 30%) compared to the more consistent performance of a Go-based VRF (key generation times below 200 microseconds, verification times under 2000 microseconds, CPU usage below 10%), highlighting trade-offs in computational efficiency and resource demands. |
| title | Quantum Enhanced Entropy Pool for Cryptographic Applications and Proofs |
| topic | Cryptography and Security Quantum Physics |
| url | https://arxiv.org/abs/2506.14340 |