Results 161 to 170 of about 3,394 (194)
Some of the next articles are maybe not open access.
Generic Attacks on Generalized Feistel Ciphers
2017Type-1, type-2 and type-3 and alternating Feistel schemes, are described by Zhen, Matsumoto, and Imai (On the construction of block ciphers provably secure and not relying on any unproved hypotheses, Springer, Heidelberg, 1990, pp. 461–480) (see also Hoang and Rogaway, On generalized Feistel networks, Springer, Heidelberg, 2010, pp. 613–630).
Valerie Nachef +2 more
openaire +1 more source
Generic Attacks on Classical Feistel Ciphers
2017In this chapter, we will give a complete description of best known attacks on classical Feistel ciphers.
Valerie Nachef +2 more
openaire +1 more source
Quantum Chosen-Ciphertext Attacks Against Feistel Ciphers
2019Seminal results by Luby and Rackoff show that the 3-round Feistel cipher is secure against chosen-plaintext attacks (CPAs), and the 4-round version is secure against chosen-ciphertext attacks (CCAs). However, the security significantly changes when we consider attacks in the quantum setting, where the adversary can make superposition queries.
Ito, Gembu +4 more
openaire +3 more sources
A chaos-based block cipher with Feistel structure
2014 IEEE 13th International Conference on Cognitive Informatics and Cognitive Computing, 2014In this paper, based on chaotic systems and balanced Feistel network structure, a symmetric block cipher with 256-bit secret key is proposed. The cipher operates on 64-bit plaintext blocks through 16 rounds computing. Within the kernel component of the cipher, i.e., round function F, a hyperchaotic system with four-wing attractors is used to improve ...
Jun Peng, Liang Lei, Qi Han, Rong Jia
openaire +1 more source
Feistel Ciphers Based on a Single Primitive
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2023Kento TSUJI, Tetsu IWATA
openaire +1 more source
The Security of Feistel Ciphers with Six Rounds or Less
Journal of Cryptology, 2002\textit{M. Luby} and \textit{C. Rackoff} [SIAM J. Comput. 17, 373-386 (1988; Zbl 0644.94018)] showed a method for constructing pseudorandom permutations from pseudorandom functions by using three or four rounds of Feistel networks. The security of their construction as well as others suggested later is measured in terms of the complexity of ...
openaire +2 more sources
An Extended Type-1 Generalized Feistel Networks: Lightweight Block Cipher for IoT
IEEE Internet of Things Journal, 2022Songtao Guo, Jing He
exaly
Full round impossible differentials for Feistel ciphers
Journal of Computer Virology and Hacking Techniques, 2023D. Zakharov, M. Pudovkina
openaire +1 more source
Modified Generalized Feistel Network Block Cipher for the Internet of Things
Symmetry, 2023Eddie Shahril Ismail +2 more
exaly