DNA-based cryptography
نویسندگان
چکیده
Recent research has considered DNA as a medium for ultra-scale computation and for ultracompact information storage. One potential key application is DNA-based, molecular cryptography systems. We present some procedures for DNA-based cryptography based on one-time-pads that are in principle unbreakable. Practical applications of cryptographic systems based on onetime-pads are limited in conventional electronic media by the size of the one-time-pad; however DNA provides a much more compact storage medium, and an extremely small amount of DNA suffices even for huge one-time-pads. We detail procedures for two DNA one-time-pad encryption schemes: (i) a substitution method using libraries of distinct pads, each of which defines a specific, randomly generated, pair-wise mapping; and (ii) an XOR scheme utilizing molecular computation and indexed, random key strings. These methods can be applied either for the encryption of natural DNA or for artificial DNA encoding binary data. In the latter case, we also present a novel use of chip-based DNA micro-array technology for 2D data input and output. Finally, we examine a class of DNA steganography systems, which secretly tag the input DNA and then hide it within collections of other DNA. We consider potential limitations of these steganographic techniques, proving that in theory the message hidden with such a method can be recovered by an adversary. We also discuss various modified DNA steganography methods which appear to have improved security.
منابع مشابه
An Introduction to Differential Computation Analysis (DCA) on the withe-box cryptography algorithms
Advances in information and communication technologies lead to use of some new devices such as smart phones. The new devices provide more advantages for the adversaries hence with respect to them, one can define with-box cryptography. In this new model of cryptography, designers try to hide the key using as a kind of implementation. The Differential Computation Analysis (DCA) is a side channel ...
متن کاملA Method to Encrypt Information with DNA-Based Cryptography
DNA cryptography is a relatively new paradigm that has attracted great interest in the field of information security. Although there are many problems in DNA cryptography, scientists are trying to solve them because they believe that, with the extraordinary information density and the vast parallelism that are inherent in DNA computers, it is possible to make a secure system. In this study, we ...
متن کاملSurvey On Encryption Algorithm Based On Chaos Theory And DNA Cryptography
DNA Cryptography is a new born cryptography that overcomes the difficulties of traditional cryptography due to its extraordinary information density inherent in DNA molecules, exceptional energy efficiency and vast parallelism. A lot of work have been done in this area based on different techniques like –DNA synthesis, PCR, Electrophoresis etc. In this paper various trends in DNA Cryptography a...
متن کاملDevelopment of a Unique Biometric-based Cryptographic Key Generation with Repeatability using Brain Signals
Network security is very important when sending confidential data through the network. Cryptography is the science of hiding information, and a combination of cryptography solutions with cognitive science starts a new branch called cognitive cryptography that guarantee the confidentiality and integrity of the data. Brain signals as a biometric indicator can convert to a binary code which can be...
متن کاملFUZZY OBSERVER DESIGN WITH n-SHIFT MULTIPLE KEY FOR CRYPTOGRAPHY BASED ON 3D HYPERCHAOTIC OSCILLATOR
A fuzzy observer based scheme for synchronizing two hyperchaoticoscillators via a scalar transmitted signal for cryptographic application isproposed. The Takagi-Sugeno fuzzy model exactly represents chaotic systems.Based on the general fuzzy model, the fuzzy observer of a chaotic system isdesigned on the basis of the n-shift multiple state based key encryption algorithm.The scalar transmitted s...
متن کاملThe new protocol blind digital signature based on the discrete logarithm problem on elliptic curve
In recent years it has been trying that with regard to the question of computational complexity of discrete logarithm more strength and less in the elliptic curve than other hard issues, applications such as elliptic curve cryptography, a blind digital signature method, other methods such as encryption replacement DLP. In this paper, a new blind digital signature scheme based on elliptic curve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999