A Review of Existing 4-Bit Crypto S-Box Cryptanalysis Techniques and Two New Techniques with 4-Bit Boolean Functions for Cryptanalysis of 4-Bit Crypto S-Boxes*

Dey, Sankhanil; Ghosh, Ranjan

doi:10.4236/apm.2018.83015

Cited by 5 publications

(3 citation statements)

References 48 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The procedure of S-block transformation in the cipher provides scattering and mixing of plaintext bytes, which in turn significantly increases the cryptographic strength of the cipher test to the implementation of various cryptanalytic attacks [11][12][13]. The most important cryptographic properties that an S-block should have are balance, high nonlinearity, high algebraic degree, low differential homogeneity, and low autocorrelation.…”

Section: Nonlinear Transformation In Encryption Algo Rithmsmentioning

confidence: 99%

“…Let N be the number of random plaintexts given and p be the probability that equation (12) holds and let |p-1/2| be small enough. Then the probability of success of the algorithm is:…”

Section: Linear Cryptanalysis Of Symmetric Block Encryp Tion Algorithmsmentioning

confidence: 99%

“…Therefore, the result for the cryptanalyst will be better if the number of eights in the table is smaller. If the number of eights is much greater than the second numbers in the table, then it is said that the 4-bit cryptographic S-block is more resistant to linear cryptanalysis [12,31,32].…”

Section: 4 Linear Cryptanalysis Of the Lbc Algorithmmentioning

confidence: 99%

See 2 more Smart Citations

Development of a new lightweight encryption algorithm

Kapalova

Algazy

Haumen

2023

EEJET

View full text Add to dashboard Cite

Lightweight encryption algorithms are considered a relatively new direction in the development of private key cryptography. This need arose as a result of the emergence of a large number of devices with little computing power and memory. Therefore, it became necessary to develop algorithms that can provide a sufficient level of security, with minimal use of resources. The paper presents a new lightweight LBC encryption algorithm. LBC is a 64–bit symmetric block algorithm. It supports 80 bit secret key. The number of rounds is 20. The algorithm has a Feistel network structure. The developed lightweight algorithm has a simple implementation scheme, and the transformations used in this algorithm have good cryptographic properties. This was verified by studying the cryptographic properties of the algorithm using the "avalanche effect" and statistical tests. The avalanche property was checked for each round when each bit of the source text was changed. Based on the work carried out, it was found that the proposed encryption algorithm is effective to ensure a good avalanche effect and the binary sequence obtained after encryption is close to random. Its security against linear and differential cryptanalysis is also evaluated. The results of the research revealed good cryptographic properties of this algorithm. The algorithm will be used for devices with small hardware resources, in information and communication systems where confidential information circulates, and it is also extremely necessary to exchange information in a protected form in an operationally acceptable time

show abstract

Section: Nonlinear Transformation In Encryption Algo Rithmsmentioning

confidence: 99%

“…Let N be the number of random plaintexts given and p be the probability that equation (12) holds and let |p-1/2| be small enough. Then the probability of success of the algorithm is:…”

Section: Linear Cryptanalysis Of Symmetric Block Encryp Tion Algorithmsmentioning

confidence: 99%

See 1 more Smart Citation

Development of a new lightweight encryption algorithm

Kapalova

Algazy

Haumen

2023

EEJET

View full text Add to dashboard Cite

show abstract

4‐bit Boolean functions in generation and cryptanalysis of secure 4‐bit crypto S‐boxes

Dey

Chakrabarti

Ghosh

2019

Security and Privacy

View full text Add to dashboard Cite

In modern ciphers of commercial computer cryptography, 4‐bit crypto substitution boxes or 4‐bit crypto S‐boxes have been of utmost importance since the late 1960s. Since then, the 4‐bit Boolean functions (BFs) have been proved to be the best tool to generate the said 4‐bit crypto S‐boxes. In this article, the crypto‐related properties of the 4‐bit BFs, such as the algebraic normal form (ANF) of the 4‐bit BFs, the balancedness, the linearity, the nonlinearity, the affinity and nonaffinity of the 4‐bit BFs, and the strict avalanche criterion (SAC) of 4‐bit BFs, are studied in detail. An exhaustive study of 4‐bit BFs with some new observations and algorithms on SAC of 4‐bit BFs is also reported in this article. In the end of 1990s, the Galois field polynomials over Galois field GF(28) are in use to generate the 8‐bit crypto S‐box of the Advance Encryption Standard. A detailed study on generation of the 4‐bit crypto S‐boxes with such Galois field polynomials over the binary as well as nonbinary extended Galois fields is also given in this article. The generated 4‐bit crypto S‐boxes are analyzed with four cryptanalysis techniques and the well‐defined SAC algorithms of 4‐bit crypto S‐boxes to search for the best possible 4‐bit crypto S‐boxes. Some existing 4‐bit crypto S‐boxes such as the thirty‐two 4‐bit crypto S‐boxes of the data encryption standard (DES) and the four 4‐bit crypto S‐boxes of the two variants of the Lucifer are analyzed to report the weakness of such S‐boxes. A comparative study of the ancient as well as the modern 4‐bit crypto S‐boxes with the generated 4‐bit crypto S‐boxes proves the said generated 4‐bit crypto S‐boxes to be the best possible one.

show abstract