1.

INTRODUCTION
The evolution of technologies over the centuries have made many common people bewildered and excited. They have experienced so many changes over the years that they have no idea what new technology will evolve tomorrow. The imagination of people has helped to generate new ideas in technology. As the time changes the technology has so modernized that people can do shopping by staying at home. The easy access of the internet to make cash transaction, do shopping, to communicate has also made people vulnerable to spamming and violation of the privacy. Cryptography provides the necessary solutions and protections for these new technologies in information society. In simple terms cryptography can be described as the art of modifying an input to an output that has no resemblance to the original. In other words, the cryptographic algorithms can be interpreted as an illusionist that gives a deceptive output to an intruder. Cryptography is the process of converting the plain text i.e., the original message to the cipher text i.e. the coded message using a key or password. Most common question that comes to mind regarding the cryptography are: What makes one cipher better than the other? What makes cipher more secure? How it makes more secure? All these can be answered in single answer. The cryptographic algorithm is secured that has no way of breaking the algorithm other that searching through every possible key. The algorithm that has larger keylength has to be searched for more possible keys in order to break it. Cryptography uses two main styles or forms of encrypting data; symmetrical and asymmetrical. Symmetric encryptions, or algorithms, use the same key for encryption as they do for decryption. Other names for this type of encryption are secret-key, shared-key, and privatekey. The encryption key can be loosely related to the decryption key; it does not necessarily need to be an exact copy. The asymmetrical cryptography method has been proven to be secure against computationally limited intruders. The most common form of asymmetrical encryption is in the application of sending messages where the sender encodes and the receiving party decodes the message by using a random key generated by the public key of the sender. The most famous and vastly used for encryption is block algorithms. The block algorithm works on a chunk of data of large size at a time. The other algorithm is stream algorithm that

works on data of variable length. The stream algorithm generates random data as cipher with the use of key.

2. LITERATURE SURVEY
This section gives the review of all the latest IEEE research papers in the cryptography field that have been read till date.

2.1 R. Wei and Z. Zeng; KIST: A new encryption algorithm based on splay; Department of Computer Science; Lakehead University; Canada
Splay tree is self-adjusting binary search tree with the additional property of recently accessed node are quick to access again by relocating the node to the root of the tree. It performs basic operations such as insertion, deletion, searching in O(lg n) amortized time. The property of splay tree is used to generate a new cryptographic algorithm KIST (Key Insertion and Splay Tree encryption). This algorithm uses asynchronous keys and the property of splay tree helps in dynamic substitution. Two important properties such as message integrity and cipher text compression is achieved via this algorithm. The main operation in this algorithm is byte xor and bytes swap. This paper tells about the algorithm with its advantages and some of its limitations. They have done chosen-cipher text attack to algorithm but suggests to do more security analysis to determine its strength to all other cyber-attacks.

2.2 Bart Preneel; The NESSIE Project: Towards New Cryptographic Algorithms; Katholieke Univ. Leuven, Dept. Electrical EngineeringESAT, Belgium
NESSIE (New European Schemes for Signature, Integrity, and Encryption) is a research project within the Information Societies Technology (IST) Programme of the European Commission [6]. This paper describes about the project named NESSIE participated by number of universities from all around the world such as Belgium, London, Germany, Israel. Its main objective was to make a call for the submission of cryptographic algorithms present in research field and to do security and performance evaluation. This project
2

brought benefits to the cryptography research community and to the users and implementors of the cryptographic algorithm. It helps the researchers and the developers by providing information about all the available algorithms and their constructions with its performance details. The project also concluded that there is need of very fast and highly secure stream cipher.

2.3 Zhang Peng, Jia Jian Fang; Comparing and Implementation of Public Key Cryptography Algorithms on Smart Card; North University of China, China; 2010 International Conference on Computer Application and System Modeling
A smart card is a plastic card about the size of a credit card, with an embedded microchip that can be loaded with data, used for telephone calling, electronic cash payments, and other applications, and then periodically refreshed for additional use. It has its own CPU, memory and COS. It implements information storage and data processing. So it has become necessary to make it secure from any violation of information security. This paper describes the RSA and ECC algorithms, compares these two cryptosystems performance applicated in smart card, and gives improvement proposal. It reaches to conclusion that ECC is a very safe and effective PKC (Public Key Cryptography). It enhances comupte power, solves large integer factorization problem and discrete logarithm algorithm will be possible to improve the efficiency of smart card encryption.

2.4 ZENG Jiqing ZHANG Mingyong; Virtual genome-based cryptography (VGC) ; Chinese Academy of Sciences, PR China; 2011 Third International Conference on Multimedia Information Networking and Security
Virtual Genome-based Cryptosystem (VGC) is a new cryptography based on system theory with many new system properties different from the previous cryptography based on the information theory.
3

This paper describes about the key features of the VGC and its characteristics. VGC can be developed as a steganography and as DNA-based cryptography. The cryptotext of the VGC is composed of the DNA sequences or any character strings. It can be applied for the digital signature, identity authentication and trademark antiCounterfeiting. VGC can be applied in all areas of information security.

2.5 Zhihua Chen, Jin Xu; One-Time-Pads Encryption in the Tile Assembly Model; Huazhong University of Science & Technology, Wuhan.
One time pad is a type of encryption which is most famously used and considered as the impossible to crack if it is used correctly. Each character or bit of plaintext is encrypted by the modular addition with a bit or character from a random secret key of same length that as of plain text. This paper describes how on combining DNA-cryptography with One Time pad makes it more secure and literally unbreakable. This paper investigates about the DNA cryptography and how each operation is computed in parallel without any human intervention. The protocol used in this insures the key security throughout the process.

2.6 Billy Bob Brumley and Kimmo U. Jarvinen; Conversion Algorithms and Implementations for Koblitz Curve Cryptography; IEEE

TRANSACTIONS ON COMPUTERS, VOL. 59, NO. 1, 2010

In this paper, they discuss the conversion between the integers and -adic expansion. This results in significant improvement in the elliptic curve cryptography using Koblitz curves. Koblitz curve is from a family of elliptic curves offering faster computation than the generic curves. This implementation considerably improves both computation speed and required area compared to the existing solution. This algorithm solves the problems faced by existing algorithm when they are implemented in hardware and on processors lacking support for multiplications. This algorithm is suitable for hardware and platform with limited instruction set and storage. The converters used in during the algorithm are faster than the existing ones. They consume fewer resources without reduction in speed.
4

2.7 Jie Chen; A DNA-based, Biomolecular Cryptography Design; Division of Engineering, Brown University, USA
This paper proposes a novel design of DNA based molecular cryptography design. It describes how the random nature of DNA can makes cryptography unbreakable. DNA can store large amounts of data in compact volume. This cryptography makes use of the parallel processing property of DNA molecule. It secretly assembles a library of one time pad in the form of DNA strand. It also presents the encryption/decryption in a twodimensional image.

2.8 Sabari Pramanik, Sanjit Kumar Setua; DNA Cryptography; 7th International Conference on Electrical and Computer Engineering, 2012.
This paper proposes a new parallel cryptography technique using DNA molecular structure, one-time pad scheme and DNA hybridization technique which minimizes the time complexity. It presented a DNA cryptography technique by using DNA digital coding technique and DNA hybridization. It uses one-time pad as encryption scheme. This method promises to be better solution for implementation in secure network. In this paper it explains DNA cryptography in step-by-step process of encryption, decryption and key generation.

2.9 Bibhash Roy, Gautam Rakshit, Pratim Singha, Atanu Majumder, Debabrata Datta; An improved Symmetric key cryptography with DNA based strong cipher; Tripura Institute of Technology, India
This paper shows the concept of DNA cryptography and its encryption and decryption process. The theoretical and implementations shows that this method is efficient in computation, storage and transmission. It is also powerful against certain attacks. This paper proposes a unique cipher text generation procedure as well as a new key generation procedure. Though the current method is suitable for use as an enhancement
5

for the other cryptography methods, this paper suggested various extensions and variations. It generates the dynamic cipher text thus enhancing its immunity to attacks.

2.10

Deepak Kumar, Shailendra Singh ; Secret Data Writing Using DNA Sequences; PEC University of Technology, India.
DNA sequences are used for exposed cryptography, computing large parallelism, extraordinary information density and exceptional energy efficiency. This paper describes the parallelism property of DNA cryptography. The encryption and decryption using One Time Pad is applied and their results in steganography. In this paper, the deficiencies in the scheme of DNA steganography and how these deficiencies can be removed. On using steganography, the data can be hidden into DNA sequences along with a key to the receiver side. Using this key and encrypted text the receiver can retrieve the plain text.

2.11

Monica BORDA, Olga TORNEA; DNA Secret Writing Techniques; Technical University of Cluj-Napoca, Romania
This paper explains the principle of bio molecular computation (BMC) and several algorithms for DNA steganography and cryptography using One Time Pad, DNA XOR OTP and DNA chromosomes indexing. It explains the DNA cryptography with small examples using bioinformatics toolbox parts. The features and advantages are described in this paper. It also point out the limitations in this field. It also mentions the exceptions on using chromosome indexing.

2.12

Avishek

Adhikari;

DNA

Secret

Sharing;

IEEE

Congress

on

Evolutionary Computation, Canada, 2006.

This paper describes the DNA secret sharing scheme. It involves two DNA computing techniques known as mixing and DNA sequencing. The simplicity of these two schemes makes it easy to implement. Using these techniques provides low error rate. The main advantage of the DNA secret sharing over other secret sharing is that a significant amount of information can be carries out in limited amount of physical space.
6

The parallelism property of DNA cryptography helps in carrying out the main operation such as or operation in efficient manner. The compact nature along with the longevity of the DNA makes secret sharing highly efficient.

2.13 Yunpeng Zhang, Bochen Fu, Xianwei Zhang; DNA Cryptography Based on DNA Fragment Assembly; Northwestern Polytechnical University, China.
This paper briefly describes the features of DNA molecular, key bio-technologies and related software. The authors design a symmetric system after analyzing the encoding of DNA and mechanism of symmetric encryption. They use the technology of DNA digital coding and DNA fragment assembly for this purpose. The paper explains the biological problems faced in DNA cryptography and the coding rules. It uses the symmetric encryption methods for making key and the data pretreatment.

2.14 Zhang Yunpeng, Wang Zhong, Zhu Yu, Richard O.Sinnott; Index-Based Symmetric DNA Encryption Algorithm; 4th International Congress on Image and Signal Processing,2011.
This paper describes a new index-based symmetric DNA encryption algorithm. The algorithm proposes that on adopting the methods of block-cipher and index of strings, it can encrypt the DNA sequence-based plaintext. The authors prove the validity of algorithm through simulations and the theoretical analysis, including bio-security and math-security. The advantage of the algorithm is that it has a huge key space, high sensitivity to plaintext and extremely great effect on encryption. The authors reached to the conclusion that on applying the block cipher, the cryptosystem can be standardized and synchronized easily. It provides an excellent performance of its encryption and an anti-attack ability.

3. BROAD AREA
Cryptography is where security engineering meets mathematics. It provides tools to modern security protocols. The basic terminology is that cryptography refers to the science and art of designing ciphers; cryptanalysis to the science and art of breaking them; while cryptology, often shortened to just crypto, is the study of both. The input to an encryption process is commonly called the plaintext, and the output the ciphertext [1]. The idea behind cipher method was born during the reign of Julius Caesar. It is believed that the Julius Caesar dispatched his secret messages by replacing the D with A, E with B and so on
[3]

. From there on the cryptography technology was modified and evolved over the

period of time. There are two methods used for stronger cipher- stream cipher and block cipher. Most widely used is the block cipher. Under block cipher DES, AES were developed. Over the years the development in cryptography society has been so vast and astonishing. Nowadays cryptography is applied in bio-molecular structure and using their properties new algorithms is designed.

4. REFERENCES
[1]. William Stallings; Cryptography and Network Security Principles and Practice; Pearson, 5th Edition,2012 [2]. C. Taylor, V. Risca, and C. Bancroft, "Hiding messages in DNA microdots", Nature. [3]. Ross Anderson; Security Engineering: A Guide to Building Dependable Distributed Systems; John Wiley & Sons, 2nd Edition,2008. [4]. http://www.cryptography.com/ [5]. http://peace.lakeheadu.ca/kist.html [6]. NESSIE, http://www.cryptonessie.org. [7]. NIST, AES Initiative, http://www.nist.gov/aes.