A Related-Key Attack on Block Ciphers with Weak Recurrent Key Schedules

Пудовкина, Марина Александровна

doi:10.1007/978-3-642-27901-0_8

Cited by 2 publications

(2 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It can be derived from the results that none of the sequences fail the first and second binary derivative test because all of the significance probabilities are all greater than 0.001. The equal number of ones and zeros in the first binary derivative stream indicates that the original stream contains an equal proportion of overlapping four 2-tuples, (00), (01), (10), (11). It can be observed that the stream ciphers RC4 and Sober then PROPOSED ALGORITHM and Rabbit results seems to be less patterned than the others.…”

Section: Binary Derivative Testmentioning

confidence: 99%

“…The One-Time Pad, which is supposed to employ a purely random key, can potentially achieve "perfect secrecy". That is, it's supposed to be fully immune to brute force attacks [9][10][11]. The proposed algorithm based non-Festal structure with well-designed substitution boxes (S-Box), permutation networks, and a serial-parallel construction functions, in addition to key derivation algorithm which used the input secret key to generate sub-keys for the proposed algorithm.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Design and Assessment of a Novel Encryption Algorithm for a Special Purpose Virtual Private Networks

Ramzy

Hussein

Omar

et al. 2018

The International Conference on Electrical Engineering

View full text Add to dashboard Cite

The Virtual Private Network (VPN) technology provides a way of protecting information being transmitted over unsecure network. VPN uses encryption to provide data confidentiality and data integrity but does not provide or enforce strong user authentication. This paper proposes a new symmetric encryption algorithm for special purpose VPN to secure the classified data. The proposed algorithm based non Feistel structure with well-designed substitution boxes (S-Box), permutation networks, and a serial-parallel construction functions, in addition to key derivation algorithm which used the input secret key to generate sub-keys input for proposed algorithm. The security analysis of the proposed was conducted and the National Institute of Standards and technology statistical tests have been applied to the output of the algorithm proving its secrecy and randomness properties. In addition, the performance of the proposed algorithm has measured per the execution time comparing with the standard algorithm.

show abstract

Section: Binary Derivative Testmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%