scholarly journals Proposed A Permutation and Substitution Methods of Serpent Block Cipher

2019 ◽  
Vol 32 (2) ◽  
pp. 131 ◽  
Author(s):  
Intisar Abid Yousif
Keyword(s):  
Block Cipher ◽  
Chaotic Maps ◽  
Data Block ◽  
Key Generation ◽  
Similar Calculation ◽  
Original Algorithm ◽  
Dynamic Methods ◽  
Encrypt Data ◽  
Time Usage

     Block cipher technique is one of cryptography techniques to encrypt data block by block. The Serpent is one of AES candidates. It encrypts a 128-bit block by using 32 rounds of a similar calculation utilizing permutations and substitutions. Since the permutations and substitutions of it are static. Then this paper proposes dynamic methods for permutation, substitution and key generation based on chaotic maps to get more security. The proposed methods are analyzed and the results showed that they were able to exceed the weakness resulting from the use of static permutations and substitutions boxes in the original algorithm and also can reduce number of rounds and time usage compared with a classical Serpent block cipher algorithm

Compact Hardware Implementations of MISTY1 Block Cipher

2017 ◽  
Vol 27 (03) ◽  
pp. 1850037 ◽  
Author(s):  
Yasir ◽  
Ning Wu ◽  
Xiaoqiang Zhang
Keyword(s):  
Low Power ◽  
Block Cipher ◽  
Comprehensive Analysis ◽  
The Other ◽  
Key Generation ◽  
Round Function ◽  
Other Hand ◽  
Hardware Implementations ◽  
Covered Area

This paper proposes compact hardware implementations of 64-bit NESSIE proposed MISTY1 block cipher for area constrained and low power ASIC applications. The architectures comprise only one round MISTY1 block cipher algorithm having optimized FO/FI function by re-utilizing S9/S7 substitution functions. A focus is also made on efficient logic implementations of S9 and S7 substitution functions using common sub-expression elimination (CSE) and parallel AND/XOR gates hierarchy. The proposed architecture 1 generates extended key with independent FI function and is suitable for MISTY1 8-rounds implementation. On the other hand, the proposed architecture 2 uses a single FO/FI function for both MISTY1 round function as well as extended key generation and can be employed for MISTY1 [Formula: see text] rounds. To analyze the performance and covered area for ASICs, Synopsys Design Complier, SMIC 0.18[Formula: see text][Formula: see text]m @ 1.8[Formula: see text]V is used. The hardware constituted 3041 and 2331 NAND gates achieving throughput of 171 and 166 Mbps for 8 rounds implementation of architectures 1 and 2, respectively. Comprehensive analysis of proposed designs is covered in this paper.

scholarly journals BLOCK CIPHERS ON THE BASIS OF REVERSIBLE CELLULAR AUTOMATA

2020 ◽  
Vol 10 (1) ◽  
pp. 8-11
Author(s):  
Yuliya Tanasyuk ◽  
Petro Burdeinyi
Keyword(s):  
Cellular Automata ◽  
Block Cipher ◽  
Key Generation ◽  
One Dimensional ◽  
C Programming Language ◽  
C Programming ◽  
Shared Secret ◽  
Reversible Cellular Automata ◽  
The Given ◽  
First Time

The given paper is devoted to the software development of block cipher based on reversible one-dimensional cellular automata and the study of its statistical properties. The software implementation of the proposed encryption algorithm is performed in C# programming language in Visual Studio 2017. The paper presents specially designed approach for key generation. To ensure desired cryptographic stability, the shared secret parameters can be adjusted to contain information needed for creating substitution tables, defining reversible rules, and hiding final data. For the first time, it is suggested to create substitution tables based on iterations of a cellular automaton that is initialized by the key data.

scholarly journals Subject Review : Key Generation in Different Cryptography Algorithm

2019 ◽  
pp. 230-240 ◽  
Author(s):  
Zainab Khyioon Abdalrdha ◽  
Iman Hussein AL-Qinani ◽  
Farah Neamah Abbas
Keyword(s):  
Data Security ◽  
Communication Channels ◽  
Data Encryption ◽  
Key Generation ◽  
Essential Component ◽  
Encrypt Data ◽  
Encryption Algorithms

The importance of encryption in most organizations, therefore, it became necessary to encrypt data because data security is an essential component in order to maintain the security of data and information in various institutions. Encryption also helps to ensure the confidentiality and integrity of data during transmission through communication channels. Given the importance of the keys used in encryption as a key part in the strength of the algorithm and increase its security in most encryption algorithms, thus generating the key in many research the most important part in data encryption and its importance lies in the non-duplication of keys to ensure better results and theoretically impossible to break. In this paper, we try to describe and review many of the papers that were used to create the keys and compare them with each other.

scholarly journals Enhancement in data security and integrity using minhash technique

2021 ◽  
Vol 21 (3) ◽  
pp. 1739
Author(s):  
Sa'ed Abed ◽  
Lamis Waleed ◽  
Ghadeer Aldamkhi ◽  
Khaled Hadi
Keyword(s):  
Data Integrity ◽  
Large Set ◽  
Key Generation ◽  
Sensitive Data ◽  
The Public ◽  
Original Algorithm ◽  
Large Sets ◽  
Integrity Checking ◽  
Encryption Decryption ◽  
Memory Utilization

Data <span>encryption process and key generation techniques protect sensitive data against any various attacks. This paper focuses on generating secured cipher keys to raise the level of security and the speed of the data integrity checking by using the MinHash function. The methodology is based on applying the cryptographic algorithms rivest-shamir-adleman (RSA) and advanced encryption standard (AES) to generate the cipher keys. These keys are used in the encryption/decryption process by utilizing the Pearson Hash and the MinHash techniques. The data is divided into shingles that are used in the Hash function to generate integers and in the MinHash function to generate the public and the private keys. MinHash technique is used to check the data integrity by comparing the sender’s and the receiver’s encrypted digest. The experimental results show that the RSA and AES algorithms based on the MinHash function have less encryption time compared to the normal hash functions by 17.35% and 43.93%, respectively. The data integrity between two large sets is improved by 100% against the original algorithm in terms of completion time, and 77% for small/medium data and 100% for large set data in terms of memory utilization.</span>

scholarly journals Perfectly Secure Shannon Cipher Construction Based on the Matrix Power Function

Symmetry ◽  
2020 ◽  
Vol 12 (5) ◽  
pp. 860
Author(s):  
Eligijus Sakalauskas ◽  
Lina Dindienė ◽  
Aušrys Kilčiauskas ◽  
Kȩstutis Lukšys
Keyword(s):  
Power Function ◽  
Block Cipher ◽  
Data Block ◽  
Theoretical Level ◽  
Complete Problem ◽  
The Matrix ◽  
Matrix Power ◽  
Shannon Cipher ◽  
One Way Function ◽  
Selection Of

A Shannon cipher can be used as a building block for the block cipher construction if it is considered as one data block cipher. It has been proved that a Shannon cipher based on a matrix power function (MPF) is perfectly secure. This property was obtained by the special selection of algebraic structures to define the MPF. In an earlier paper we demonstrated, that certain MPF can be treated as a conjectured one-way function. This property is important since finding the inverse of a one-way function is related to an N P -complete problem. The obtained results of perfect security on a theoretical level coincide with the N P -completeness notion due to the well known Yao theorem. The proposed cipher does not need multiple rounds for the encryption of one data block and hence can be effectively parallelized since operations with matrices allow this effective parallelization.

scholarly journals Improved RC6 Algorithm using Two Types of Chaos Maps

2019 ◽  
Vol 9 (1) ◽  
pp. 2856-2860
Keyword(s):  
Chaotic Maps ◽  
Scheduling Algorithm ◽  
Advanced Encryption Standard ◽  
Key Generation ◽  
Key Length ◽  
Key Scheduling ◽  
Better Than

RC6 (Rivest cipher 6) is keyblock chipher which consider symmetric imitative from RC5. It was intended to encounter the needs competition of the Advanced Encryption Standard (AES) . The aim of this work is to add new security layer to RC6 (Rivest Cipher 6) algorithm, because there is some insufficiency in the Key Scheduling Algorithm (KSA) of RC6. This paper presents improved RC6 (IRC6) key generation based on two types of chaotic maps (Chebyshev,2d logistic) to generate N key to N users. The results prove that the average secrecy of IRC6 is better than of traditional RC6, in which: for 32 bits’ key length, and 256 bits’ plaintext size, the average secrecy of IRC6 is (0.536 - 3.907) while for RC6 is (0.254 constant).

Perfect Secrecy System Based on Chaotic Key Generator

2018 ◽  
Vol 1 (2) ◽  
pp. 1-12 ◽  
Author(s):  
Mahmood Khalel Ibrahem
Keyword(s):  
Unique Solution ◽  
Chaotic Maps ◽  
Sufficient Information ◽  
Encrypt Data ◽  
Cryptographic System ◽  
Perfect Secrecy

Shannon defines perfect secrecy for a cryptographic system as such a cryptographic system in which the ciphertext yields no possible information about the plaintext. Diffie and Hellman suggest computationally secure cryptographic systems even if the intercepted data contains sufficient information to allow a unique solution to the cryptographic problems. In this paper, we present the new idea to cipher data called a perfect secrecy and its implementation based on the chaotic maps for generating a one-time random key used to encrypt data. The output ciphertext has been examined and shows perfect random properties.

Block cipher using 1D and 2D chaotic maps

2010 ◽  
Vol 2 (3) ◽  
pp. 244 ◽  
Author(s):  
Narendra K. Pareek ◽  
Vinod Patidar ◽  
Krishan K. Sud
Keyword(s):  
Block Cipher ◽  
Chaotic Maps
Sign in / Sign up

Export Citation Format

Share Document