DNA计算在密码学中的进展与应用

需积分: 10 191 浏览量更新于2024-07-17 收藏 17.85MB PDF 举报

"Advances of DNA Computing in Cryptography" 是一本由Suyel Namasudra和Ganesh Chandra Deka编写的书籍，探讨了DNA计算在密码学领域的进展。该书于2018年9月10日发布，包含197页，涵盖了DNA计算在密码学中的应用、公钥密码学的实现、基于DNA的安全模型分类、新型数据加密方案、DNA计算在云计算环境中的应用、DNA计算中的安全攻击分类、以及安全性、隐私、信任和匿名性的讨论等主题。 DNA计算是一种新兴的技术，它利用生物分子（DNA）进行信息处理和计算，这为密码学带来了全新的视角。本书的第1章介绍了DNA计算在密码学中的基础，阐述了这一领域的基本概念和发展历程。第2章探讨了如何在DNA密码学中实施公钥密码系统，这是一种非对称加密技术，其中的密钥分为公开和私有两部分，确保了信息的安全交换。第3章对基于DNA的安全模型进行了分类，分析了不同的安全架构和策略。第4章则提出了一种利用DNA计算的创新数据加密方案，这种方案可能具有更高的加密强度和抗攻击性。第5章关注DNA计算在云计算环境中的应用，讨论了在云存储和处理中的安全挑战及解决方案。第6章详细阐述了针对DNA计算的各种安全攻击类型，包括可能的篡改、欺骗和窃取信息的手段。第7章深入讨论了DNA计算中的安全、隐私、信任和匿名性问题，这些都是现代密码学和信息安全的关键要素。第8章专门介绍了一种DNA计算算法，展示了如何利用DNA的特性设计高效的计算过程。最后一章，第9章，展望了DNA计算的应用和未来趋势，包括可能的技术突破和潜在的应用场景。书中还提到了MATLAB和Simulink的使用，但表明这些工具的使用并不代表MathWorks对特定教育方法或软件应用的背书。这本书是关于DNA计算与密码学交叉领域的宝贵资源，对于理解生物计算技术如何增强信息安全，以及未来可能出现的创新加密技术具有重要意义。

Contributors

Bibhudendra Acharya

Department of Electronics and

Telecommunication

Engineering

National Institute of Technology

Raipur, Chhattisgarh, India

Balusamy Balamurugan

School of Computing Science and

Engineering

Galgotias University

Greater Noida, Uttar Pradesh, India

Rohan Bali

School of Computing Science and

Engineering

Galgotias University

Greater Noida, Uttar Pradesh,

India

Sandeep Choudhary

Department of Computer Science and

Engineering

Birla Institute of Technology

Mesra, Jharkhand, India

Satya Ranjan Dash

School of Computer Applications

Kalinga Institute of Industrial

Technology

Bhubaneswar, Odisha, India

Ganesh Chandra Deka

Directorate General of Training

Ministry of Skill Development and

Entrepreneurship

Ra Marg, New Delhi, India

Debashree Devi

Department of Computer Science and

Engineering

National Institute of Technology Silchar

Assam, India

Suresh Kallam

School of Computing Science and

Engineering

Galgotias University

Greater Noida, Uttar Pradesh, India

Selvaraj Karthikeyan

School of Computing Science and

Engineering

Galgotias University

Greater Noida, Uttar Pradesh, India

Awanish Kumar

Department of Biotechnology

National Institute of Technology

GE Road, Raipur, Chhattisgarh, India

Suyel Namasudra

School of Computing Science and

Engineering

Galgotias University

Greater Noida, Uttar Pradesh, India

Rizwan Patan

School of Computing Science and

Engineering

Galgotias University

Greater Noida, Uttar Pradesh, India

Kintaali Abhimanyu Kumar Patro

Department of Electronics and

Telecommunication Engineering

National Institute of Technology

Raipur, Chhattisgarh, India

Rahul Roy

ei2 Classes and Technologies

Durgapur, West Bengal, India

Alo Sen

ei2 Classes and Technologies

Durgapur, West Bengal, India

Introduction of DNA Computing in Cryptography

Suyel Namasudra and Ganesh Chandra Deka

1.1 Introduction

The security of data has become more and more important as data are shared through the

cloud in heterogeneous devices (Deka and Das, 2014; Namasudra, 2017, 2018; Namasudra

et al., 2017a; Namasudra et al., 2014). Cryptography is the technique of secret writing

(Willett, 1982; Lin, 1998). The main goal of cryptography is to transmit data or messages

(les) between the sender and receiver over an untrusted medium in such a manner that an

attacker or malicious user is unable to read the original data content. It can also be used for

the authentication of customers and users.

In cryptography, the plaintext refers to an ordinary readable data or message. The encryp-

tion process takes plaintext as input and generates ciphertext as output by using a secret key

and encryption algorithm. The process of recovering the plaintext from the ciphertext by

using the secret key is known as decryption. Fundamentally, there are two types of crypto-

systems, based on how the encryption and decryption processes are carried out:

1. Symmetric key encryption

2. Asymmetric key encryption

The main dissimilarity between these two cryptographic systems is the use of the decryp-

tion and encryption keys. Both these keys are strongly associated in any cryptosystem.

Advances of DNA Computing in Cryptography

Introduction of DNA Computing in Cryptography

CONTENTS

1.1 Introduction ............................................................................................................................ 1

1.1.1 Key Management in Cryptography ........................................................................3

1.2 Steganography ........................................................................................................................4

1.3 Background Studies of DNA ................................................................................................5

1.4 DNA Computing ....................................................................................................................7

1.4.1 Why DNA Computing?.............................................................................................8

1.5 DNA Computing in Cryptography ..................................................................................... 9

1.5.1 Polymerase Chain Reaction .................................................................................... 10

1.5.2 DNA-Based Steganography .................................................................................... 11

1.5.3 DNA-Based Chip Technology ................................................................................12

1.6 Future Research Work Directions ..................................................................................... 13

1.7 Conclusions ........................................................................................................................... 15

Key Terms and Denitions .......................................................................................................... 15

References ....................................................................................................................................... 16

References for Advanced/Further Reading .............................................................................. 18

2 Advances of DNA Computing in Cryptography

In symmetric key encryption, the secret key is shared between the sender and receiver,

and the encryption and decryption processes are executed by using the same key (Kumar

and Wollinger, 2006; Schneier, 1996). Here, the length of the key is small, so the encryp-

tion and decryption processes are fast and use less computer processing power. In the

1970s, all cryptosystems used symmetric key encryption. Nowadays, it is still used in

many cryptosystems. Some examples of symmetric key encryption are Digital Encryption

Standard (DES), IDEA, BLOWFISH and Triple-DES (3DES). There are two main types of

symmetric key encryption:

1. Stream cipher, where the bytes or digits of a message are encrypted one at a time.

2. Block cipher, where a number of bits are taken as a single unit, and then this unit is

encrypted. Here, plaintext is padded to make it multiple block size. In block cipher,

64-bit blocks are commonly used.

However, symmetric encryption requires establishing a secure key-exchange mecha-

nism, and the sender and receiver have to trust each other. Otherwise, they may lose their

secret information, and there is always a chance that the key will be given to others. Thus,

data may face security issues. Figure 1.1 shows the symmetric key encryption process.

Asymmetric key encryption is also known as public key cryptography. Here, different

keys or values are used to encrypt and decrypt data or a message, and the process does not

require sharing keys between the sender and receiver. The keys are usually large numeric

numbers and are mathematically correlated to each other even if they are different. The

asymmetric key encryption process was invented in the 20th century because it was nec-

essary to pre-share the secret key between two parties. In this process, every party has a

pair of keys:

1. A private key

2. A public key, where one key is utilized at the time of encryption, and the other is

utilized at the time of decryption (Katayangi and Murakami, 2001).

Computationally, it is unfeasible that one key could be determined based on another key

even though both keys are mathematically correlated, which is the strength of asymmetric

FIGURE 1.1

Symmetric key encryption.

3Introduction of DNA Computing in Cryptography

key encryption. In addition, the strength of the encryption is associated with the key

size, and doubling the key length supports an exponential enhancement of its strength.

However, users need to trust the third party for key management, which is one of the

challenging issues of asymmetric key encryption. Figure 1.2 shows a block diagram of

asymmetric key encryption.

Some examples of asymmetric key encryption are Secure Shell (SSH), OpenPGP and dig-

ital signature. It is also utilized in many online services, such as browsers that require the

establishment of a secure or trusted connection over an unsecured or untrusted network.

To create a better cryptosystem, it is preferable to use symmetric algorithms, since they

are fast and secure compared to asymmetric algorithms (Knudsen, 1994; de Cannière

et al., 2006).

1.1.1 Key Management in Cryptography

Key management is one of the important aspects of any cryptosystem. There are three

main steps in key management:

1. Key generation: Key is generated for encryption and decryption.

2. Key revocation: Key is revoked from a user or customer, when s/he is not an autho-

rized user.

3. Key distribution: Key is distributed in a secure way (Chaeikar et al., 2010). This is the

most vital step for key management, since in this step, attackers or malicious users

try to get the secret key by using an attack.

So, if a strong algorithm is used for key generation, but the key distribution process lacks

security, then the security of the whole cryptosystem might be at risk. An algorithm has

been proposed to distribute the key in an unsecured medium (Dife and Hellman, 1976).

The main contributions of this chapter are to present an overview of cryptography and

DNA computing. Here, all the basics of cryptography are presented. Background studies

of DNA and the applications of DNA computing in the eld of cryptography are also dis-

cussed in this chapter.

FIGURE 1. 2

Asymmetric key encryption.

剩余197页未读，继续阅读

THESUMMERE

粉丝: 23
资源: 328

DNA计算在密码学中的进展与应用

非常规计算理论探索：Advances in Unconventional Computing Vol. 1

Ian F. Blake的椭圆曲线加密进展——《Advances in Elliptic Curve Cryptography》

图像处理中的软计算与机器学习进展

Advances in Intelligent Computing epub

Research Advances in Cloud Computing PDF

Research Advances in Cloud Computing epub

Advances in Intelligent Computing 无水印原版pdf

Research Advances in Cloud Computing 无水印原版pdf

Advances in Soft Computing and Machine Learning in Image Processing 无水印pdf

Advances in Soft Computing and Machine Learning in Image Processing (2018)

最新资源