Justification of methods for calculating and analyzing the properties of pseudorandom and random sequences based on DNA
DOI:
https://doi.org/10.30837/rt.2024.2.217.02Keywords:
ДНК, випадкові послідовності, екстрактори, симетричне шифрування, постквантові стандарти, статистичне тестування, гешування, оцінка подібностіAbstract
An integral requirement for modern information systems is to provide users with services such as confidentiality, integrity, availability, and irrefutability. The quality of such services directly depends on cryptographic transformations, an important component of most of which is randomness. Therefore, the generation of pseudorandom and random sequences is one of the most relevant and important tasks in cryptography. Such sequences are generated based on physical and non-physical noise sources. Our previous studies indicate the theoretical possibility to use DNA as a noise source and, accordingly, as a source of random sequences.
Any noise source "contains randomness", i.e. it has a certain amount of entropy, but a sample from such a source will not always have good properties. That is why there is a need for tools that can obtain sequences with good randomness properties of samples from the DS sequences with good randomness properties of samples from the noise source (by, for example, some kind of enhancement). Such sequences should satisfy the necessary conditions: be statistically indistinguishable, uniform, etc. NIST-approved DRBG designs can be used to guarantee this. Such constructions are most often based on strong crypto-primitives, such as hashes, HMACs, or block or stream ciphers in the required modes.
This work is devoted to newly developed methods for obtaining pseudorandom and random sequences based on DNA sequences using the national standard for block symmetric encryption DSTU 7624:2014 in the counter (CTR) operation mode, as well as methods for comparing sequences (both DNA and binary).
The work essentially opens the topic of obtaining random sequences based on DNA, since previous studies of DNA in cryptography have focused on the use of DNA in encryption and steganography. The paper presents the results of solving such issues as the development of methods for obtaining DNA-based sequences, the evaluation of statistical and stochastic properties of such sequences, and the evaluation of similarity based on k-mer and MinHash distances.
The results obtained indicate the prospects and relevance of further research in this area.
References
Matthias Peter, Werner Schindler. A Proposal for Functionality Classes for Random Number Generators. Version 2.36 – Current intermediate document for the AIS 20/31 workshop. 2023. URL: https://www.bsi.bund.de/SharedDocs/Downloads/EN/BSI/Certification/Interpretations/AIS_31_Functionality_classes_for_random_number_generators_e_2023.html?nn=910324
Горбенко І. Д., Дерев’янко Я. А., Горбенко Д. Ю. ДНК – джерело шуму та нефізичних випадкових
послідовностей. Основні положення практичних досліджень. 2024.
URL: https://cyberwarfare.viti.edu.ua/assets/files/Cyberwarfare_2024.pdf
Національна Бібліотека Медицини США. URL: https://ftp.ncbi.nlm.nih.gov/genbank/
ДНК банк Японії. URL: https://ddbj.nig.ac.jp/arsa/quick_search?lang=en;jsessionid=5FC7A34BD7FA0826284A6619E85BCA97
ДСТУ 7624:2014. Інформаційні технології. Криптографічний захист інформації. Алгоритм симет-ричного блокового перетворення. 2015. URLhttps://online.budstandart.com/ua/catalog/doc-page.html?id_doc=109736
Linux manual page. random. URL: https://man7.org/linux/man-pages/man4/random.4.html
Shaun Wilkinson. Introduction to the kmer R package. 2019. URL: https://cran.r-project.org/web/packages/kmer/vignettes/kmer-vignette.html.
Edgar, R. C. Local homology recognition and distance measures in linear time using compressed amino acid alphabets. 2004. URL: https://europepmc.org/backend/ptpmcrender.fcgi?accid=PMC373290&blobtype=pdf
Mash. Fast genome and metagenome distance estimation using MinHash. Sketches. URL: https://mash.readthedocs.io/en/latest/sketches.html
Andrei Z. Broder. On the resemblance and containment of documents. 1998. URL: https://web.archive.org/web/20150131043133/http://gatekeeper.dec.com/ftp/pub/dec/SRC/publications/broder/positano-final-wpnums.pdf
Brian D. Ondov, Todd J. Treangen, Páll Melsted, Adam B. Mallonee, Nicholas H. Bergman, Sergey Koren & Adam M. Phillippy. Mash: fast genome and metagenome distance estimation using MinHash. 2016. URL: https://genomebiology.biomedcentral.com/articles/10.1186/s13059-016-0997-x
ДСТУ 7564:2014. Інформаційні технології. Криптографічний захист інформації. Функція гешу-вання. 2015. URL: https://usts.kiev.ua/wp-content/uploads/2020/07/dstu-7564-2014.pdf.
John Kelsey. Truncation Mode for SHA. 2005. URL: https://csrc.nist.gov/csrc/media/events/first-cryptographic-hash-workshop/documents/kelsey_truncation.pdf
NIST SP 800-22 Rev. 1. A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications. 2010, URL: https://nvlpubs.nist.gov/nistpubs/Legacy/SP/nistspecialpublication800-22r1a.pdf
Microsoft Documentation. CryptGenRandom function (wincrypt.h). 2021. URL: https://learn.microsoft.com/en-us/windows/win32/api/wincrypt/nf-wincrypt-cryptgenrandom
Downloads
Published
How to Cite
Issue
Section
License
Authors who publish with this journal agree to the following terms:
1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
