Publications - Pervasive Computing Laboratory

Access control anotacionsemantica authentication Cloud computing coap compromise cryptography cynamon Discovery emadrid emrisco home network I-Shaper identity management inrisco inteligenciafuentesabiertas Internet of Things IoT magos Pervasive computing privacy Protocols Qursa Ramones raudo2 Security Smart Card Trust management Ubisec VANETs 
Show all
2024
 Lorenzo, Vicente;  Blanco-Romero, Javier;  Almenares, Florina;  Díaz-Sánchez, Daniel;  Rubio, Carlos García;  Campo, Celeste;  Marín, Andrés
Comparing Pseudo, Classical True and Quantum Random Number Generators Using Standard Quality Assessments Proceedings Article 
In: XVIII Reunión Española sobre Criptología y Seguridad de la Información: XVIII RECSI, León 23-25 octubre 2024, Universidad de León, Servicio de Publicaciones, 2024.
Abstract | Links | BibTeX | Tags: compromise, CTRNGs, I-Shaper, PRNGs, QRNGs, Qursa, rngs
@inproceedings{vicente002,

title = {Comparing Pseudo, Classical True and Quantum Random Number Generators Using Standard Quality Assessments},

author = {Vicente Lorenzo and Javier Blanco-Romero and Florina Almenares and Daniel Díaz-Sánchez and Carlos García Rubio and Celeste Campo and Andrés Marín},

url = {https://buleria.unileon.es/bitstream/handle/10612/24646/Comparing_Pseudo_Classical_True.pdf?sequence=1&isAllowed=y},

doi = {https://hdl.handle.net/10612/24646},

year  = {2024},

date = {2024-11-05},

urldate = {2024-11-05},

booktitle = {XVIII Reunión Española sobre Criptología y Seguridad de la Información: XVIII RECSI, León 23-25 octubre 2024},

publisher = {Universidad de León, Servicio de Publicaciones},

abstract = {Nowadays, there exists a wide variety of Random Number Generators (RNGs). If the source of randomness is unpredictable physical phenomena, as in physical chips or quantum-based RNGs, they are called True Random Number Generators (TRNGs). If it is a deterministic mathematical algorithm, as in software-based RNGs, they are called Pseudo- Random Number Generators (PRNGs). This study evaluates and compares the quality of three Quantum RNGs, three TRNGs and three PRNGs. The comparative analysis includes NIST SP 800-22, NIST SP 800-90B entropy, Borel normality and Diehard tests, which are which are frequently used for assessing RNG quality.},

keywords = {compromise, CTRNGs, I-Shaper, PRNGs, QRNGs, Qursa, rngs},

pubstate = {published},

tppubtype = {inproceedings}

}

Close
Nowadays, there exists a wide variety of Random Number Generators (RNGs). If the source of randomness is unpredictable physical phenomena, as in physical chips or quantum-based RNGs, they are called True Random Number Generators (TRNGs). If it is a deterministic mathematical algorithm, as in software-based RNGs, they are called Pseudo- Random Number Generators (PRNGs). This study evaluates and compares the quality of three Quantum RNGs, three TRNGs and three PRNGs. The comparative analysis includes NIST SP 800-22, NIST SP 800-90B entropy, Borel normality and Diehard tests, which are which are frequently used for assessing RNG quality.
Close
https://buleria.unileon.es/bitstream/handle/10612/24646/Comparing_Pseudo_Classic[...]
doi:https://hdl.handle.net/10612/24646
Close