Randomness analysis on 3D-AES block cipher

Ariffin, Suriyani; Yusof, Nor Azeala Mohd

doi:10.1109/fskd.2017.8393289

Cited by 9 publications

(3 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The 3D-AES encryption method [22] proposed by Nakahara in 2008 aimed at large-capacity data security and efficiency with a 512-bit key/block length and 22 rounds. However, in the study published by Ariffin and Yusof in 2007, they showed that 3D-AES failed at the 0.001 significance level and was unreliable in the randomness test they performed on different datasets generated with 2 rounds for key avalanche observations [23]. On the other hand, the avalanche-effect test, in its current form, is also the subject of current studies.…”

Section: Literaturementioning

confidence: 97%

SAAC - Kriptosistemlerin analizi için istatistiksel mutlak çığ-etkisi kriter testi

BAYSAN>

Özekes

2022

ECJSE

View full text Add to dashboard Cite

Cryptosystems using binary radix (bit) arrays must first meet the strict avalanche criterion, which prevents correlation between input and output values in order to resist differential attacks. For this criterion, which is also called confusion/diffusion and butterfly-effect in the common literature, it is expected that two inputs with only one-bit difference from each other will cause half the total number of bits to differ in the output bits. While the literature includes the difference of at least half of the output bits, it does not include that changing all the bits will cause the binary complement and thus another undesirable result. The Statistical Absolute Avalanche Criterion (SAAC) test proposed in this study allows the statistical determination of a lower limit and the establishment of hypotheses. The SAAC test is a tool that can be easily used in the analysis of cryptosystems, especially encryption methods and message hash functions.

show abstract

Section: Literaturementioning

confidence: 97%

SAAC - Kriptosistemlerin analizi için istatistiksel mutlak çığ-etkisi kriter testi

BAYSAN>

Özekes

2022

ECJSE

View full text Add to dashboard Cite

show abstract

“…The randomness test refers to the strategies that were considered while assessing the minimum security requirement for a cryptographic algorithm. Statistical analysis may determine whether an algorithm meets the security criteria or not [4]. The Rectangle algorithm was subjected to statistical analysis, based on a 1% significance level; the results showed that it is not random.…”

Section: Introductionmentioning

confidence: 99%

Comparison of the Randomness Analysis of the Modified Rectangle Block Cipher and Original algorithm

Baker

Nori

2022

NTU-JPS

View full text Add to dashboard Cite

In recent years, different encryption lightweight algorithms have been suggested to protect the security of data transferred across the IoT network. The symmetric key ciphers play a significant role in the security of devices, in particular block ciphers. the RECTANGLE algorithm amongst the current lightweight algorithms. Rectangle algorithm does have good encryption efficacy but the characteristics of confusion and diffusion that a cipher needed are lacking from this algorithm. Therefore, by improving the algorithm confusion and diffusion properties, we expanded Rectangle utilizing a 3D cipher and modified the key scheduling algorithm. To assess if these two algorithms are random or not, randomness analysis was done by using the NIST Statistical Test Suite. To create 100 samples for each algorithm, nine distinct data categories were used. These algorithms created ciphertext blocks, which were then concatenated to form a binary sequence. NIST tests carried out under 1% significance level. According to the results of the comparison study, the proposed algorithm's randomness analysis results are gave 27.48% better results than the original algorithm.

show abstract

“…To further measure the security of any cryptographic algorithms, randomness analysis is also considered [14]- [16]. Randomness is one of the security analysis to measure the cryptographic strength of a block cipher or its key.…”

Section: Introductionmentioning

confidence: 99%

Randomness Analysis on Enhanced Key Security of Playfair Cipher Algorithm

Marzan¹

2019

IJATCSE

View full text Add to dashboard Cite

The cryptographic quality of the cipher algorithm depends on its key security. Typically, cryptographic applications provide unpredictable keys to strengthen the security of the plaintext. Despite advancements made in the field of cryptography, security loopholes still exist. As such, this paper proposed a key security of Playfair cipher algorithm by applying Playfair cipher 16x16 matrix, XOR operator, two's complement, and bit swapping. It also describes randomness tests on the proposed method that has been implemented on the existing application. We selected seven suitable randomness tests provided by NIST Test Suite. Experimental results show that the generated binary sequences are random as the proposed method passed all selected randomness tests which include frequency (Monobit) test, frequency test within a block, run test, test for the longest run of ones in a block, discrete Fourier transform, approximate entropy test, and cumulative sums test. In fact, among the different length of keys (10, 20, 30, and 40), we obtained P-values ranging from 0.01 to 1.00. It only means that no pattern has found, thus the key is unpredictable.

show abstract

Randomness analysis on 3D-AES block cipher

Cited by 9 publications

References 9 publications

SAAC - Kriptosistemlerin analizi için istatistiksel mutlak çığ-etkisi kriter testi

SAAC - Kriptosistemlerin analizi için istatistiksel mutlak çığ-etkisi kriter testi

Comparison of the Randomness Analysis of the Modified Rectangle Block Cipher and Original algorithm

Randomness Analysis on Enhanced Key Security of Playfair Cipher Algorithm

Contact Info

Product

Resources

About