Analysis of key randomness in improved one-time pad cryptography
dc.contributor.author | Manucom, Emraida Marie M. | |
dc.contributor.author | Gerardo, Bobby D. | |
dc.contributor.author | Medina, Ruji P. | |
dc.date.accessioned | 2024-08-14T07:45:16Z | |
dc.date.available | 2024-08-14T07:45:16Z | |
dc.date.issued | 2019-12-09 | |
dc.identifier.citation | Manucom, E. M. M., Gerardo, B. D., & Medina, R. P. (2019, October). Analysis of key randomness in improved one-time pad cryptography. In 2019 IEEE 13th International Conference on Anti-counterfeiting, Security, and Identification (ASID) (pp. 11-16). IEEE. https://doi.org/10.1109/ICASID.2019.8925173 | en |
dc.identifier.isbn | 978-1-7281-2458-2 | |
dc.identifier.issn | 2163-5048 | |
dc.identifier.uri | https://hdl.handle.net/20.500.14353/598 | |
dc.description.abstract | In cryptography, one-time pad (OTP) is claimed to be the perfect secrecy algorithm in several works if all of its features are applied correctly. Its secrecy depends mostly on random keys, which must be truly random and unpredictable. Random number generators are used in key generation. In Psuedo Random Number Generator (PRNG), the possibility of producing numbers that are predictable and repeated exists. In this study, a proposed method using True Random Number Generator (TRNG) and Fisher-Yates shuffling algorithm are implemented to generate random keys for OTP. Frequency (monobit) test, frequency test within a block, and runs tests are performed and showed that the proposed method produces more random keys. Sufficient confusion and diffusion properties are obtained using Pearson correlation analysis. | en |
dc.description.sponsorship | This work is sponsored by the Commission on Higher Education, Faculty Development Program II. The authors are grateful for the continuous support to the professional development of the faculty through providing financial assistance. | en |
dc.language.iso | en | en |
dc.publisher | IEEE Computer Society | en |
dc.subject | Cryptography | en |
dc.subject | Fisher-Yates algorithm | en |
dc.subject | One-time pad | en |
dc.subject | Random keys | en |
dc.subject | Random numbers | en |
dc.subject | Shuffling algorithm | en |
dc.subject | OTP | en |
dc.subject | True random number generator | en |
dc.subject | Pseudo random number generator | en |
dc.subject | Encryption algorithm | en |
dc.subject.lcsh | Computer algorithms | en |
dc.subject.lcsh | Cryptography--Data processing | en |
dc.subject.lcsh | Cryptography | en |
dc.subject.lcsh | Numbers, Random | en |
dc.subject.lcsh | Number theory | en |
dc.subject.lcsh | Random number generators | en |
dc.title | Analysis of key randomness in improved one-time pad cryptography | en |
dc.type | Conference paper | en |
dcterms.accessRights | Limited public access | en |
dc.citation.firstpage | 11 | en |
dc.citation.lastpage | 16 | en |
dc.identifier.essn | 2163-5056 | |
dc.identifier.doi | 10.1109/ICASID.2019.8925173 | |
dc.citation.conferencetitle | 13th IEEE International Conference on Anti-Counterfeiting, Security, and Identification, ASID 2019 | en |
local.isIndexedBy | Scopus | en |
Files in this item
This item appears in the following Collection(s)
-
Conference Papers [14]
Conference papers published externally, written by WVSU faculty members, staff, and students