Innovative DNA Clustering-Based Hierarchy Tree Model to Cryptanalyze Shift Register Based-Stream Cipher.

Saved in:

Bibliographic Details
Title:	Innovative DNA Clustering-Based Hierarchy Tree Model to Cryptanalyze Shift Register Based-Stream Cipher.
Authors:	Sahar Yaseen, Basim¹ basimsahar@sa-uc.edu.iq, Alghalibi, Maha¹
Source:	Iraqi Journal for Electrical & Electronic Engineering. Jun2026, Vol. 22 Issue 1, p564-571. 8p.
Subjects:	Stream ciphers, Shift registers, Clustering algorithms, Cryptography, Hierarchical clustering (Cluster analysis)
Abstract (English):	The paper presents a novel approach that merges the abilities of the biological environment with the concept of hierarchical trees to attack a specific stream cipher. The model being presented introduces a systematic method that targets a group of stream ciphers, such as the GCM family, these devices are composed of components that are suitable for the proposed method. A restricted set of binaries for the final key sequence is required to implement this technique as an input. The attacked algorithm comprises feedback shift registers, memories, delays, and so on. The stream ciphers are widely used in modern encryption to secure communication devices, so any attempt to analyze or attack it is of the utmost importance. The results of this method have been confirmed to lead to the destruction of the cipher’s security. Many novelties and contributions of the present work can be summarized as follows: firstly, the key generator’s components are attacked individually, disrupting the cohesion between them. This was not possible previously except in rare cases and under difficult conditions. Secondly, the method of verifying the correct initial values is unrelated to the generator’s operation. Thirdly, the technique applies biological concepts and processes to laboratory test tubes for genetic engineering, it can be said that the prepared model targets a broad class of stream key generators, rather than a single algorithm. The proposed technique requires a specific and deterministic number of final key sequence bits, which are easy to provide. The proposed technique creates a search E -tree in the style of hierarchical clusters, in which the first level containsE nodes. Then each successive level contains the square of E nodes of the number of nodes in the previous level, and the root is composed of the total solution space of the stream key generator and produces the nodes of each level from the intersection of the cluster contents in the test tubes for all clusters in the level above it. The contribution and novelty of the present work is cryptanalyzing and attacking shift register-based stream key generators involves fragmentation. The attacking principle entails disassembling generator components from registers and individually attacking them. DNA logic clustering aids in this process, as the strength of these generators relies on component cohesion. Because the components are cryptanalyzed individually, the time complexity of the attack is equal to O(C2 N), where N is the length of the largest component, and C is a constant [ABSTRACT FROM AUTHOR]
Abstract (Arabic):	يركز المقال على نموذج شجري هرمي جديد قائم على تجميع الحمض النووي (DNA) مصمم لتحليل الشفرات المتدفقة المبنية على سجلات الإزاحة، لا سيما تلك المكونة من سجلات الإزاحة ذات التغذية الراجعة الخطية (LFSRs) وسجلات الإزاحة ذات التغذية الراجعة غير الخطية (NLFSRs). يستخدم هذا النهج مفاهيم بيولوجية وعمليات مختبرية لتجزئة ومهاجمة مكونات مولدات مفاتيح التدفق بشكل فردي، مما يعطل تماسكها—وهو عامل أساسي في أمانها. يقوم النموذج ببناء شجرة بحث هرمية من الدرجة E تقوم بشكل منهجي بتقليل فضاء الحلول عبر تجميع تسلسلات القواعد الجينية المستخلصة من تيار المفتاح (keystream)، مما يتيح بحثًا بتقنية القسمة والغزو (divide-and-conquer) لإيجاد القيم الأولية الصحيحة للسجلات. تظهر النتائج التجريبية فعالية الطريقة في استعادة الحالات الأولية بتعقيد أقل وعدد أقل من بتات النص الصريح مقارنةً بتقنيات تحليل الشفرات القائمة على الحمض النووي المماثلة. تسلط الدراسة الضوء على إمكانيات بيئات الحوسبة البيولوجية في كشف نقاط الضعف في الشفرات المتدفقة الحديثة، وتثير تساؤلات حول مدى قابلية تطبيق هذه الأساليب على أنواع شفرات أكثر تعقيدًا أو مختلفة. [Extracted from the article]
	Copyright of Iraqi Journal for Electrical & Electronic Engineering is the property of Republic of Iraq Ministry of Higher Education & Scientific Research (MOHESR) and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database:	Engineering Source

Description
Abstract:	The paper presents a novel approach that merges the abilities of the biological environment with the concept of hierarchical trees to attack a specific stream cipher. The model being presented introduces a systematic method that targets a group of stream ciphers, such as the GCM family, these devices are composed of components that are suitable for the proposed method. A restricted set of binaries for the final key sequence is required to implement this technique as an input. The attacked algorithm comprises feedback shift registers, memories, delays, and so on. The stream ciphers are widely used in modern encryption to secure communication devices, so any attempt to analyze or attack it is of the utmost importance. The results of this method have been confirmed to lead to the destruction of the cipher’s security. Many novelties and contributions of the present work can be summarized as follows: firstly, the key generator’s components are attacked individually, disrupting the cohesion between them. This was not possible previously except in rare cases and under difficult conditions. Secondly, the method of verifying the correct initial values is unrelated to the generator’s operation. Thirdly, the technique applies biological concepts and processes to laboratory test tubes for genetic engineering, it can be said that the prepared model targets a broad class of stream key generators, rather than a single algorithm. The proposed technique requires a specific and deterministic number of final key sequence bits, which are easy to provide. The proposed technique creates a search E -tree in the style of hierarchical clusters, in which the first level containsE nodes. Then each successive level contains the square of E nodes of the number of nodes in the previous level, and the root is composed of the total solution space of the stream key generator and produces the nodes of each level from the intersection of the cluster contents in the test tubes for all clusters in the level above it. The contribution and novelty of the present work is cryptanalyzing and attacking shift register-based stream key generators involves fragmentation. The attacking principle entails disassembling generator components from registers and individually attacking them. DNA logic clustering aids in this process, as the strength of these generators relies on component cohesion. Because the components are cryptanalyzed individually, the time complexity of the attack is equal to O(C2 N), where N is the length of the largest component, and C is a constant [ABSTRACT FROM AUTHOR]
ISSN:	18145892
DOI:	10.37917/ijeee.22.1.50