University of Bahrain
Scientific Journals

Constructing Hierarchical DNA Clustering Model (HDCM) To Cryptanalyze Feedback Shift Register-Based Stream Cipher

Show simple item record

dc.contributor.author S. Yaseen, Dr.Basim
dc.date.accessioned 2024-01-05T13:00:43Z
dc.date.available 2024-01-05T13:00:43Z
dc.date.issued 2024-01-02
dc.identifier.uri https://journal.uob.edu.bh:443/handle/123456789/5292
dc.description.abstract When evaluating and analyzing encryption techniques and algorithms, cryptanalysis is a fundamental scientific field on which cybersecurity depends. In the past few decades, forensic science has been enhanced by adding DNA technology, which has brought powerful capabilities. Hierarchical DNA clustering is recursively clustering DNA points into many clusters. A genetic keystream can be represented by a binary, a triple, or a tree, depending on the number of genetic bases of clusters. Many encryption systems and algorithms rely on the shift register's physical component and the avalanche concept to ensure security. This makes it difficult for attackers to dismantle the components of the shift registers and attack them individually. Experts and stakeholders consider these components' increasing complexity and large size as a strength factor for these systems. However, a proposed model challenges the cohesion of these systems through the principle of fragmentation by attack. It works by fragmenting and attacking the shift registers and then reducing the initial values they adopt to produce the final key sequence. The principle of reduction depends on the concept of clustering, which involves creating clusters of initial key values whose contents are interrupted and reduced at each level of the binary tree created for the key sequence's genetic bases. The model involves two specific processes - a divide-and-conquer approach and a DNA binary tree clustering process - which significantly reduces the solution space and searches for the initials of LFSRs and NLFSRs. Our technique requires approximately C(2^n ) to attack, where C is a constant, and n is the largest length of either LFSRs or NLFSRs. The first process includes splitting the shift registers individually and classifying their outputs based on the pre-calculated DNA sequence for the generator's outputs. The second process creates classification clusters (Test Tubes) for the initial values of the shift registers using the genetic bases that make up the final key sequence (Zi). The proposed model aims to disrupt the cohesion of these systems by fragmenting and attacking the shift registers. The novelty and contributions  discovering a mathematical or logical base model that can be expressed as a theory. This theory can then counteract and weaken the coherence principle in stream cipher generators that rely on displacement registers. By doing so, we can effectively attack this family of generators such as the Global System for Mobile Communications (GSM) algorithms.  Identifying hidden vulnerabilities that can be exploited to attack these generators will help manufacturing experts and users become aware of these weaknesses and take necessary precautions. en_US
dc.language.iso en en_US
dc.publisher Unversity of Bahrain en_US
dc.subject DNA computing, Search Tree, Hierarchal Clustering, Feedback Shift Register, Stream cipher. en_US
dc.title Constructing Hierarchical DNA Clustering Model (HDCM) To Cryptanalyze Feedback Shift Register-Based Stream Cipher en_US
dc.identifier.doi 10.12785/ijcds/xxxxxx
dc.volume 15 en_US
dc.issue 1 en_US
dc.pagestart 1 en_US
dc.pageend 8 en_US
dc.contributor.authorcountry Iraq en_US
dc.contributor.authoraffiliation Department of Computer Sciences/Shatt Al-arab University College en_US
dc.source.title International Journal of Computing and Digital Systems en_US
dc.abbreviatedsourcetitle IJCDS en_US


Files in this item

This item appears in the following Issue(s)

Show simple item record

All Journals


Advanced Search

Browse

Administrator Account