Enhancement CAST block algorithm to encrypt big data

Kadhim, F Alaa; Abdul-Majeed, Ghassan H.; Ali, Rasha S.

doi:10.1109/ntict.2017.7976119

Cited by 19 publications

(16 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Any of the cryptosystems encrypts plaintext image into an image that has random pixels. After the process of encryption, the purpose of histogram analysis is to show the dispersal of these pixels [27].…”

Section: Histogram Analysismentioning

confidence: 99%

A Power Associative Loop Structure for the Construction of Non-Linear Components of Block Cipher

et al. 2020

View full text Add to dashboard Cite

In the symmetric key cryptography, the purpose of the substitution box is to generate confusion and hence improve the security of the whole cryptosystem. For this reason, many algebraic substitution boxes are constructed depending upon the associative algebras of Galois fields. In this paper, the power associative loop is used for the construction of substitution boxes. This novel structure comprises excellent features which include, the inverse of zero element, non-associativity and fewer constraints as compared to the cyclic group and Galois field. In comparison to existing substitution boxes, the substitution boxes based upon power associative loop are comparatively easy and the above-mentioned properties offer the number of structures to construct highly nonlinear substitution boxes. To obtain the number of substitution boxes, we further applied the symmetric group of order 16 on the proposed substitution box. The evaluation of proposed boxes with different algebraic and statistical analyses like nonlinearity test, strict avalanche criterion, bit independence criterion, linear approximation probability and differential approximation probability indicate the strength of proposed substitution boxes. Majority logic criterion results depict that proposed substitution boxes have better cryptographic strength to apply in different techniques of secure communication.

show abstract

Section: Histogram Analysismentioning

confidence: 99%

A Power Associative Loop Structure for the Construction of Non-Linear Components of Block Cipher

et al. 2020

View full text Add to dashboard Cite

show abstract

“…The group G 5 =<x: x 32 =1> of order 32 with only one generator, that is, x:= (27,24,28,21,3,11,5,25,17,9,23,26,8,12,18,20,7,30,22,14,19,29,15,6,1,10,4,2,32,31,13,16); acts naturally on the index set I Ωi of A 1 that is, 5×5 S-box from chaos-based search. This action can be defined as:…”

Section: B Proposed Group Structures and Actionsmentioning

confidence: 99%

“…Due to open and insecure nature of internet and networking technologies, security of sensitive information and multimedia data has been crucial issue since decades. Over the years, different types of data security techniques have been suggested the cryptographers [1,2]. Depending upon how data is processed, the cryptographic algorithms can be classified as block ciphers and stream ciphers.…”

Section: Introductionmentioning

confidence: 99%

Bijective S-Boxes Method Using Improved Chaotic Map-Based Heuristic Search and Algebraic Group Structures

et al. 2020

View full text Add to dashboard Cite

This paper presents a hybrid method for the construction of cryptographically strong bijective substitution-boxes by utilizing the merits of chaotic map and algebraic groups. The hybrid method first generates the key-dependent dynamic S-boxes using chaotic heuristic search strategy and then the S-boxes are evolved with the help of potent proposed algebraic group structures. This paper proposes a new improved combination chaotic map to operate initial search strategy. To augment the strength of generated S-boxes, the algebraic group structures are discovered which have the power to improve their cryptographic strength. The performance assessments using standard criterions are rendered to quantify the strengths of proposed bijective S-boxes. The experimental results and comparisons with recent S-box research findings justify the effectiveness and competence of the proposed bijective S-boxes and anticipated hybrid generation method.

show abstract

“…Write the hypothesis for T test: Writing a test hypothesis for Pearson Correlation: H0: There is no linear relationship between Time and Method 2 for results 1 H1: There is a linear relationship between Time and Method 2 for results 1 The results of T test and Correlation obtained through applying the SPSS statistical analysis program for the data are as follows:…”

Section: A Test Metthod-1mentioning

confidence: 99%

“…Since there is a limited number of trained and experienced personnel that are able to verify the validity of these biases manually, it is necessary to find an efficient and inexpensive method, particularly one that does not require vast experience or an advanced level of training. Hence, it is dependent on computer methods [1]- [6]. It can store and retain sensitive and important information and data securely by eliminating data fraud, enhancing data safety and security.…”

Section: Introductionmentioning

confidence: 99%

A Novel Improvement With an Effective Expansion to Enhance the MD5 Hash Function for Verification of a Secure E-Document

Ali

Farhan

2020

IEEE Access

View full text Add to dashboard Cite

MD5 is a one-way cryptographic function used in various fields for maintaining data integrity. The application of a Hash function can provide much protection and privacy and subsequently reduce data usage. Most users are familiar with validating electronic documents based on a Hash function, such as the MD5 algorithm and other hash functions, to demonstrate the data integrity. There are many weaknesses of the current MD5 algorithm, mainly its failures and weaknesses against varying types of attacks, such as brute force attacks, rainbow table attacks, and Christmas attacks. Therefore, the method proposed in this paper enhances the MD5 algorithm by adding a dynamic variable length and a high efficiency that simulates the highest security available. Whereas the logistic system was used to encode ribonucleic acid (RNA) by generating a random matrix based on a new key that was created using the initial permutation (IP) tables used in the data encryption stander (DES) with the linear-feedback shift register (LFSR), this work proposes several structures to improve the MD5 hash function. The experimental results demonstrate its high resistance to hackers while maintaining a suitable duration. This paper discusses the design of a confident hash algorithm. This algorithm has characteristics that enable it to succeed in the field of digital authentication and data integrity.

show abstract

Enhancement CAST block algorithm to encrypt big data

Cited by 19 publications

References 3 publications

A Power Associative Loop Structure for the Construction of Non-Linear Components of Block Cipher

A Power Associative Loop Structure for the Construction of Non-Linear Components of Block Cipher

Bijective S-Boxes Method Using Improved Chaotic Map-Based Heuristic Search and Algebraic Group Structures

A Novel Improvement With an Effective Expansion to Enhance the MD5 Hash Function for Verification of a Secure E-Document

Contact Info

Product

Resources

About