Chaotic Rivest-Shamir-Adlerman Algorithm with Data Encryption Standard Scheduling

Cryptography, which involves the use of a cipher, describes a process of encrypting information so that its meaning is hidden and thus, secured from those who do not know how to decrypt the information. Cryptography algorithms come with the various types including the symmetric key algorithms and asymmetric key algorithms. In this paper, the authors applied the most commonly used algorithm, which is the RSA algorithm together with the Chaos system and the basic security device employed in the worldwide organizations which is the Data Encryption Standard (DES) with the objective to make a hybrid data encryption. The advantage of a chaos system which is its unpredictability through the use of multiple keys and the secrecy of the RSA which is based on integer factorization’s difficulty is combined for a more secure and reliable cryptography. The key generation was made more secure by applying the DES schedule to change the keys for encryption. The main strength of the proposed system is the chaotic variable key generator that chages the value of encrypted message whenever a different number of key is used. Using the provided examples the strength of security of the proposed system was tested and demonstrated.

Download Full-text

Cryptanalytic Attacks on IDEA Block Cipher

Defence Science Journal ◽

10.14429/dsj.66.10798 ◽

2016 ◽

Vol 66 (6) ◽

pp. 582 ◽

Cited By ~ 5

Author(s):

Harish Kumar Sahu ◽

Vikas Jadhav ◽

Shefali Sonavane ◽

R.K. Sharma

Keyword(s):

Block Cipher ◽

Data Encryption ◽

Secret Key ◽

Data Confidentiality ◽

Data Encryption Standard ◽

Financial Application ◽

Time Requirements ◽

International Data ◽

Key Block ◽

Symmetric Key

International data encryption algorithm (IDEA) is a secret key or symmetric key block cipher. The purpose of IDEA was to replace data encryption standard (DES) cipher, which became practically insecure due to its small key size of 56 bits and increase in computational power of systems. IDEA cipher mainly to provide data confidentiality in variety of applications such as commercial and financial application e.g. pretty good privacy (PGP) protocol. Till 2015, no successful linear or algebraic weaknesses IDEA of have been reported. In this paper, author explained IDEA cipher, its application in PGP and did a systematic survey of various attacks attempted on IDEA cipher. The best cryptanalysis result which applied to all keys could break IDEA up to 6 rounds out of 8.5 rounds of the full IDEA cipher1. But the attack requires 264 known plaintexts and 2126.8 operations for reduced round version. This attack is practically not feasible due to above mention mammoth data and time requirements. So IDEA cipher is still completely secure for practical usage. PGP v2.0 uses IDEA cipher in place of BassOmatic which was found to be insecure for providing data confidentiality.

Download Full-text

Predominance of Blowfish Over Triple Data Encryption Standard Symmetric Key Algorithm for Secure Integrated Circuits Using Verilog HDL

SSRN Electronic Journal ◽

10.2139/ssrn.3656150 ◽

2017 ◽

Author(s):

V. Kumara Swamy

Keyword(s):

Integrated Circuits ◽

Data Encryption ◽

Verilog Hdl ◽

Data Encryption Standard ◽

Symmetric Key

Download Full-text

Improved Structure of Data Encryption Standard Algorithm

Journal of Southwest Jiaotong University ◽

10.35741/issn.0258-2724.55.5.12 ◽

2020 ◽

Vol 55 (5) ◽

Author(s):

Mays M. Hoobi

Keyword(s):

Data Encryption ◽

Encryption Algorithm ◽

Key Generation ◽

Brute Force ◽

Generation System ◽

Data Encryption Standard ◽

Standard Algorithm ◽

Standard Data ◽

Cipher Text ◽

Major Data

The Internet is providing vital communications between millions of individuals. It is also more and more utilized as one of the commerce tools; thus, security is of high importance for securing communications and protecting vital information. Cryptography algorithms are essential in the field of security. Brute force attacks are the major Data Encryption Standard attacks. This is the main reason that warranted the need to use the improved structure of the Data Encryption Standard algorithm. This paper proposes a new, improved structure for Data Encryption Standard to make it secure and immune to attacks. The improved structure of Data Encryption Standard was accomplished using standard Data Encryption Standard with a new way of two key generations. This means the key generation system generates two keys: one is simple, and the other one is encrypted by using an improved Caesar algorithm. The encryption algorithm in the first 8 round uses simple key 1, and from round 9 to round 16, the algorithm uses encrypted key 2. Using the improved structure of the Data Encryption Standard algorithm, the results of this paper increase Data Encryption Standard encryption security, performance, and complexity of search compared with standard Data Encryption Standard. This means the Differential cryptanalysis cannot be performed on the cipher-text.

Download Full-text

High throughput FPGA Implementation of Data Encryption Standard with time variable sub-keys

International Journal of Electrical and Computer Engineering (IJECE) ◽

10.11591/ijece.v6i1.pp298-306 ◽

2016 ◽

Vol 6 (1) ◽

pp. 298

Author(s):

Soufiane Oukili ◽

Seddik Bri

Keyword(s):

High Throughput ◽

Data Encryption ◽

Fpga Implementation ◽

Time Variable ◽

Digital Data ◽

Data Encryption Standard ◽

Gate Arrays ◽

Hardware Implementations ◽

Symmetric Key ◽

Legacy Applications

<span lang="EN-US">The Data Encryption Standard (DES) was the first modern and the most popular symmetric key algorithm used for encryption and decryption of digital data. Even though it is nowadays not considered secure against a determined attacker, it is still used in legacy applications. This paper presents a secure and high-throughput Field Programming Gate Arrays (FPGA) implementation of the Data Encryption Standard algorithm. This is achieved by combining 16 pipelining concept with time variable sub-keys and compared with previous illustrated encryption algorithms. The sub-keys vary over time by changing the key schedule permutation choice 1. Therefore, every time the plaintexts are encrypted by different sub-keys. The proposed algorithm is implemented on Xilinx Spartan-3e (XC3s500e) FPGA. Our DES design achieved a data encryption rate of 10305.95 Mbit/s and 2625 number of occupied CLB slices. These results showed that the proposed implementation is one of the fastest hardware implementations with much greater security.</span>

Download Full-text

Cloud based Secure Storage of Files using Hybrid Cryptography and Image Steganography

International Journal of Recent Technology and Engineering - 2 ◽

10.35940/ijrte.f7227.038620 ◽

2020 ◽

Vol 8 (6) ◽

pp. 665-667

Keyword(s):

Data Encryption ◽

Image Steganography ◽

Advanced Encryption Standard ◽

Sensitive Information ◽

Least Significant Bit ◽

Data Encryption Standard ◽

Secure Storage ◽

Symmetric Key ◽

Encryption Algorithms ◽

High Level

Cloud Computing has made it possible to provide individuals as well as organizations with a utility that is costeffective. It empowers businesses by delivering these services using the internet. Files can be shared through the cloud. These files may contain sensitive information that needs to be kept hidden from anonymous users. This is done using cryptographic algorithms. High level of security can be provided using hybrid cryptography to encrypt the data. Advanced Encryption Standard (AES) and Triple Data Encryption Standard (3DES) are the symmetric key encryption algorithms used to secure. An asymmetric key encryption algorithm, Rivest-Shamir-Adleman (RSA) helps in providing a hybrid cryptography model. The security of the key generated can be further enhanced using image steganography method Least Significant Bit (LSB). These issues regarding the security and its challenges will be addressed in this paper and also analyse the measures to handle it.

Download Full-text

Symmetric Key and Polynomial Based Key Generation Mechanism for Secured Data Communications in 5G Networks

10.21203/rs.3.rs-565284/v1 ◽

2021 ◽

Author(s):

Pradeep Suthanthiramani ◽

Muthurajkumar Sannasy ◽

Sannasi Ganapathy ◽

Arputharaj Kannan

Keyword(s):

Artificial Intelligence ◽

Data Communication ◽

Data Encryption ◽

Fuzzy Rules ◽

Security Requirements ◽

Data Communications ◽

Key Generation ◽

5G Networks ◽

Binomial Theorem ◽

Symmetric Key

Abstract Fifth Generation (5G) networks provide data communications through various latest technologies including Software Defined Network (SDN), Artificial Intelligence, Machine Learning and Cloud Computing. In 5G, secure data communication is a challenging issue due to the presence of enormous volume of users including malicious users communicating with latest technologies and also based their own requirements. In such a scenario, fuzzy rules and cryptographic techniques can play a major role in providing security to the data which are either communicated through the network or stored in network based databases including distributed databases and cloud databases with cloud networks. Therefore, new and efficient mechanisms for generation and exchange of keys are necessary since they are the most important component of cryptographic methods. Since most of the existing key generation techniques are focusing on 3G and 4G networks, new key generation methods that can be generalized to n-th order polynomials are necessary to suit the security requirements of 5G networks which is smart by using rules from Artificial Intelligence. This paper proposes a new key generation and encryption/decryption mechanism which is based on both symmetric key cryptography and polynomial operations for providing effective security on data communication in 5G networks. In this work, we introduce the usage of fuzzy rules and Binomial Theorem (Pascal triangle) technique for performing the data encryption process more efficiently since it is not used in any of the existing cryptographic algorithms. Moreover, two different polynomial equations, one of degree three and another of degree two are used in the proposed work for effective key generation. Here, we have applied differential calculus for finding the second-degree polynomial. In the decryption part of the proposed mechanism, nth root operation is applied which is able to reduce the number of steps used in a single mode operation. The experimental results of the proposed work proved that the proposed security model with fuzzy rule-based approach is better than other related systems that are available in the literature in terms of reduction in computational complexity and increase in security.

Download Full-text