Abstract
Cryptography is an approach known for the authentication, security, and intruder preventive communication. The work presented here is an improvement over the traditional symmetric cryptography mechanism with the inclusion of deoxyribonucleic acid (DNA) encoding. The work is divided into two main stages. First a DNA encoding based substitution is used for cryptography where a data sequence is taken as an Input key, and second is databits transformation and addition. The work is applied on Images. MSE and PSNR values are used to perform result analysis.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Wang, X. (2002). Finding patterns in three-dimensional graphs: Algorithms and applications to scientific data mining. IEEE Transactions on Knowledge and Data Engineering. 1041-4347/02@2002 IEEE.
Rao, A. (2002). A clustering algorithm for gene expression data using wavelet packet decomposition. 0-7803-7576-9/02@2002 IEEE.
Pei, J. (2003). MaPle: A fast algorithm for maximal pattern-based clustering. In Proceedings of the Third IEEE International Conference on Data Mining (ICDM’03). 0-7695-1978-4/03 © 2003 IEEE.
Wang, H. (2004). A fast algorithm for subspace clustering by pattern similarity. In Proceedings of the 16th International Conference on Scientific and Statistical Database Management (SSDBM’04). 1099-3371/04 © 2004 IEEE.
Zhang, Z. (2004). Mining deterministic biclusters in gene expression data. In Proceedings of the Fourth IEEE Symposium on Bioinformatics and Bioengineering (BIBE’04). 0-7695-2173-8/04 © 2004 IEEE.
Jiang, D. (2004). Cluster analysis for gene expression data: A survey. IEEE Transactions on Knowledge and Data Engineering. 1041-4347/04@2004 IEEE.
Patra, J. C. (2005). Neural networks for gene expression analysis and gene selection from DNA microarray. In Proceedings of International Joint Conference on Neural Networks. 0-7803-9048-2/05©2005 IEEE.
Pan, J. (2005). Efficient algorithms for mining maximal frequent concatenate sequences in biological datasets. In Proceedings of the 2005 The Fifth International Conference on Computer and Information Technology (CIT’05). 0-7695-2432-X/05 © 2005 IEEE.
Hirsh, H. (1994). Using background knowledge to improve inductive learning of DNA sequences. 1043-0989/94@ 1994 IEEE.
Wu, F. X. (2006). On determination of minimum sample size for discovery of temporal gene expression patterns. In Proceedings of the First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS’06). 0-7695-2581-4/06 © 2006 IEEE.
Ma, P. C. H. (2009). An iterative data mining approach for mining overlapping co expression patterns in noisy gene expression data. IEEE Transactions on Nano Bioscience. 1536-1241 © 2009 IEEE.
Yan, L. (2009). Closed structured patterns and motifs mining without candidate maintenance. 978-0-7695-3880-8/09 © 2009 IEEE.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media Singapore
About this paper
Cite this paper
Nandal, N., Panghal, S. (2016). A Two-Stage Integrated Approach of DNA Cryptography. In: Satapathy, S., Joshi, A., Modi, N., Pathak, N. (eds) Proceedings of International Conference on ICT for Sustainable Development. Advances in Intelligent Systems and Computing, vol 409. Springer, Singapore. https://doi.org/10.1007/978-981-10-0135-2_40
Download citation
DOI: https://doi.org/10.1007/978-981-10-0135-2_40
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-0133-8
Online ISBN: 978-981-10-0135-2
eBook Packages: EngineeringEngineering (R0)