Using Hadamard transform for cryptanalysis of pseudo-random generators in stream ciphers

Sosa-Gómez, Guillermo; Rojas, Omar; Páez-Osuna, Octavio

doi:10.4108/eai.13-7-2018.163980

Cited by 2 publications

(2 citation statements)

References 27 publications

(31 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Guillermo Sosa-Gómez et al [91] showed the cryptanalysis of PRNGs for cryptographic ciphers. Also, a correlation analysis of the entropy of PRNGs and Hadamard values indicate a strong correlation.…”

Section: Open Research Problemsmentioning

confidence: 99%

Quantum Randomness in Cryptography—A Survey of Cryptosystems, RNG-Based Ciphers, and QRNGs

Saini¹,

Tsokanos²,

Kirner³

2022

Information

View full text Add to dashboard Cite

Cryptography is the study and practice of secure communication with digital data and focuses on confidentiality, integrity, and authentication. Random number generators (RNGs) generate random numbers to enhance security. Even though the cryptographic algorithms are public and their strength depends on the keys, cryptoanalysis of encrypted ciphers can significantly contribute to the unveiling of the cipher’s key. Therefore, to ensure high data security over a network, researchers need to improve the randomness of keys as they develop cryptosystems. Quantum particles have a leading edge in advancing RNG technology as they can provide true randomness, unlike pseudo-random numbers generators (PRNGs). In order to increase the level of the security of cryptographic systems based on random numbers, this survey focuses on three objectives: Cryptosystems with related cryptographic attacks, RNG-based cryptosystems, and the design of quantum random number generators (QRNGs). This survey aims to provide researchers with information about the importance of RNG-based ciphers and various research techniques for QRNGs that can incorporate quantum-based true randomness in cryptosystems.

show abstract

Section: Open Research Problemsmentioning

confidence: 99%

Quantum Randomness in Cryptography—A Survey of Cryptosystems, RNG-Based Ciphers, and QRNGs

Saini¹,

Tsokanos²,

Kirner³

2022

Information

View full text Add to dashboard Cite

show abstract

“…These two criteria measure different characteristics of the change's effect that an input bit has on the output bits; while the SAC verifies uniformity in the distribution of each output bit, the BIC measures the degree of independence between the output bits [15]. The SAC has been extended to be applied to stream ciphers [16][17][18][19][20][21][22]. In [22], the RC4 stream cipher [23] was evaluated through the SAC and the existence of statistical dependence between the input bits and outputs of the RC4 was detected for inputs of large size.…”

Section: Introductionmentioning

confidence: 99%

Bit Independence Criterion Extended to Stream Ciphers

et al. 2020

Self Cite

View full text Add to dashboard Cite

The bit independence criterion was proposed to evaluate the security of the S-boxes used in block ciphers. This paper proposes an algorithm that extends this criterion to evaluate the degree of independence between the bits of inputs and outputs of the stream ciphers. The effectiveness of the algorithm is experimentally confirmed in two scenarios: random outputs independent of the input, in which it does not detect dependence, and in the RC4 ciphers, where it detects significant dependencies related to some known weaknesses. The complexity of the algorithm is estimated based on the number of inputs l, and the dimensions, n and m, of the inputs and outputs, respectively.

show abstract

Using Hadamard transform for cryptanalysis of pseudo-random generators in stream ciphers

Cited by 2 publications

References 27 publications

Quantum Randomness in Cryptography—A Survey of Cryptosystems, RNG-Based Ciphers, and QRNGs

Quantum Randomness in Cryptography—A Survey of Cryptosystems, RNG-Based Ciphers, and QRNGs

Bit Independence Criterion Extended to Stream Ciphers

Contact Info

Product

Resources

About