Information Security Using DNA Sequences

   يعد أمن المعلومات من المواضيع المهمة، ويرجع ذلك أساسًا إلى النمو الهائل في استخدام الإنترنت على مدى السنوات القليلة الماضية. نتيجة لهذا النمو، كانت هناك حالات وصول غير مصرح به، والتي تم تقليلها بفضل "استخدام مجموعة من بروتوكولات الاتصال الآمن، مثل التشفير وإخفاء البيانات". باستخدام القدرات الجزيئية الحيوية للحمض النووي، ازداد استخدام الحمض النووي كناقل للتشفير وإخفاء البيانات في السنوات الأخيرة. أثار إدراك أن الحمض النووي قد يعمل كوسيط نقل أثار هذه الحركة. في هذه الدراسة، نفحص أولاً ونلخص بإيجاز تطور نظام ترميز الحمض النووي الحالي. بعد ذلك، يتم تصنيف الطرق العديدة التي تم بها استخدام الحمض النووي لتحسين تقنيات التشفير. تمت مناقشة مزايا وعيوب هذه الخوارزميات وأحدث التطورات في تقنيات التشفير القائم على الحمض النووي. أخيرًا، نقدم أفكارنا حول المستقبل المحتمل لخوارزميات التشفير القائمة على الحمض النووي.Information security is a significant cause for concern, mainly because of the explosive growth in internet usage over the last few years. Due to this growth, there have been occurrences of unauthorized access, which have been reduced thanks to “using a range of secure communication protocols, such as encryption and data concealment”. Using DNA's bio-molecular capabilities, the usage of DNA as a carrier for encryption and data concealing has increased in recent years. The realization that DNA may function as a transport medium sparked this movement. In this study, we first examine and briefly outline the evolution of the present DNA coding system. After that, the several ways DNA has been used to enhance encryption techniques are categorized. The benefits and drawbacks of these algorithms and the most recent advancements in DNA-based encryption techniques are discussed. Finally, we provide our thoughts on the potential future of DNA-based encryption algorithms. &nbsp

Data protection based neural cryptography and deoxyribonucleic acid

The need to a robust and effective methods for secure data transferring makes the more credible. Two disciplines for data encryption presented in this paper: machine learning and deoxyribonucleic acid (DNA) to achieve the above goal and following common goals: prevent unauthorized access and eavesdropper. They used as powerful tool in cryptography. This paper grounded first on a two modified Hebbian neural network (MHNN) as a machine learning tool for message encryption in an unsupervised method. These two modified Hebbian neural nets classified as a: learning neural net (LNN) for generating optimal key ciphering and ciphering neural net CNN) for coding the plaintext using the LNN keys. The second granulation using DNA nucleated to increase data confusion and compression. Exploiting the DNA computing operations to upgrade data transmission security over the open nets. The results approved that the method is effective in protect the transferring data in a secure manner in less tim

A New Hybrid Cryptosystem Involving DNA,Rabin, One Time Pad and Fiestel

Information security is a crucial need in the modern world. Data security is a real concern, and many customers and organizations need to protect their sensitive information from unauthorized parties and attackers. In previous years, numerous cryptographic schemes have been proposed. DNA cryptography is a new and developing field that combines the computational and biological worlds. DNA cryptography is intriguing due to its high storage capacity, secure data transport, and massive parallel computing. In this paper, a new combination is proposed that offers good security by combining DNA, the Rabin algorithm, one time pad, and a structure inspired by Fiestel. This algorithm employs two keys. The first key is a DNA OTP key which is used for only one secure communication session. The second key, which combines the public and private keys, is a Rabin key. Additionally, by using a Feistel inspired scheme and randomness provided by DNA, the ciphertext is made harder to obtain without the private key.Comment: 11 page

Octopus++: an enhanced mutual authentication security protocol and lightweight encryption and decryption algorithm based on DNA in fog computing

The Internet of Things (IoT) envisions a world wherein everyday objects may connect to the internet and exchange data, analyse, store, and gather data from their environment and efficiently mediate on it. Fog computing, closer to the IoT, is formulated in data processing, filtering, aggregating, and storing. In fog IoT network one of the main challenges is security. The existing security solutions are based on modern cryptography algorithms are computationally complex which causes the fog IoT network to slow down. Therefore, in fog IoT the operations must be lightweight and secure. The security considerations include attacks, especially Man in the Middle attack (MitM), challenges, requirements, and existing solutions that are deeply analyzed and reviewed. Hence, omega network key generation based on deoxyribonucleic acid (ONDNA) is proposed, which provides lightweight encryption and decryption in fog computing. The security level of ONDNA is tested using NIST test suite. ONDNA passes all the 17 recommended NIST Test Suite tests. Next, we proposed a modified security protocol based on ONDNA and hash message authentication code with secure hash algorithm 2. The modified protocol is noted as OCTOPUS++. We proved that the OCTOPUS++ provides confidentiality, mutual authentication, and resistance to MitM attack using the widely accepted Burrows Abdi Needham (BAN) logic. The OCTOPUS++ is evaluated in terms of execution time. The average execution time for 20-time execution of OCTOPUS++ is 1.018917 milliseconds. The average execution time for Octopus, LAMAS and Amor is 2.444324, 20.1638 and 14.1152 milliseconds respectively. The results show that the OCTOPUS++ has less execution time than other existing protocol

RFID Technology in Intelligent Tracking Systems in Construction Waste Logistics Using Optimisation Techniques

Construction waste disposal is an urgent issue for protecting our environment. This paper proposes a waste management system and illustrates the work process using plasterboard waste as an example, which creates a hazardous gas when land filled with household waste, and for which the recycling rate is less than 10% in the UK. The proposed system integrates RFID technology, Rule-Based Reasoning, Ant Colony optimization and knowledge technology for auditing and tracking plasterboard waste, guiding the operation staff, arranging vehicles, schedule planning, and also provides evidence to verify its disposal. It h relies on RFID equipment for collecting logistical data and uses digital imaging equipment to give further evidence; the reasoning core in the third layer is responsible for generating schedules and route plans and guidance, and the last layer delivers the result to inform users. The paper firstly introduces the current plasterboard disposal situation and addresses the logistical problem that is now the main barrier to a higher recycling rate, followed by discussion of the proposed system in terms of both system level structure and process structure. And finally, an example scenario will be given to illustrate the system’s utilization

DNA Computing and its Application

The objectives of this chapter are twofold: firstly to introduce DNA computation, and secondly to demonstrate how DNA computing can be applied to solve large, complex combinatorial problems, such as the optimal scheduling of a group of elevators servicing a number of floors in a multi-storey building

DNA Computing and Its Application on NP Completeness Problem

Abstract. DNA computing is emerging research area that attracts many researchers in multidiscipline area range from biology, physics, mathematics, and computer science. Nowadays, many researchers already solved problem using this technique, mostly classified as NP (Nondeterministic Polynomial) problem since the inheritance of DNA computing in processing simultaneously and it huge memory capacity. Despite very promising, DNA computing faces several obstacles such as exponential solution explosion, representing weight etc. This paper aim is to give a review on current achievement on DNA computing upon NP-completeness problem