![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Advances in Computers, Volume 129
Volume 129, 2023
Perspective of DNA Computing in Computer Science
- Suyel Namasudra:
Preface. xi-xii - Tarun Kumar, Suyel Namasudra:
Chapter One - Introduction to DNA computing. 1-38 - Maria Fernandes
, Jérémie Decouchant
, Francisco M. Couto:
Chapter Two - Security, privacy, and trust management in DNA computing. 39-81 - Jiechao Gao, Tiange Xie:
Chapter Three - DNA computing in cryptography. 83-128 - Chiranjeev Bhaya
, Arup Kumar Pal, SK Hafizul Islam:
Chapter Four - A novel image encryption and decryption scheme by using DNA computing. 129-172 - P. Bharathi Devi, P. Ravindra, R. Kiran Kumar:
Chapter Five - Hiding information in an image using DNA cryptography. 173-210 - Jun Peng
, Shangzhu Jin, Yingxu Wang, Xi Zheng, Xiangren Wang:
Chapter Six - The design of a S-box based on DNA computing and chaos theories. 211-248 - Deepak Sharma, Manojkumar Ramteke:
Chapter Seven - DNA computing-based Big Data storage. 249-279 - Divyansh Agrawal
, Sachin Minocha:
Chapter Eight - Securing confidential data in the cloud environment by using DNA computing. 281-316 - Sathish Gunasekaran, Manish Kumar:
Chapter Nine - Secure data communication using DNA computing adaptable to wireless sensor network. 317-361 - Sachin Minocha, Suyel Namasudra:
Chapter Ten - Research challenges and future work directions in DNA computing. 363-387
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.