Results 161 to 170 of about 43,138 (200)
Some of the next articles are maybe not open access.

Generic Attacks on Expanding Feistel Ciphers

2017
“Generic” Unbalanced Feistel Ciphers with Expanding Functions are Unbalanced Feistel Ciphers with truly random internal round functions from n bits to (k − 1)n bits with k ≥ 3. From a practical point of view, an interesting property of these schemes is that since n < (k − 1)n and n can be small (8 bits for example), it is often possible to store these ...
Jacques Patarin   +2 more
openaire   +1 more source

Generic Attacks on Contracting Feistel Ciphers

2017
This chapter deals with generic attacks on unbalanced Feistel ciphers with contracting functions. These ciphers are used to construct pseudo-random permutations from kn bits to kn bits by using r pseudo-random functions from (k − 1)n bits to n bits. The study concerns KPA and NCPA against these schemes with less than 2 kn plaintext/ciphertext pairs and
Jacques Patarin   +2 more
openaire   +1 more source

Applying evolutionary computation methods for the cryptanalysis of Feistel ciphers

Applied Mathematics and Computation, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Elena C. Laskari   +3 more
openaire   +2 more sources

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

LLBC: A Novel Feistel-Based Low-Latency Block Cipher for IoT Applications

IEEE Internet of Things Journal
Low-latency has been an important criterion in the design of block ciphers, especially in lightweight cryptography for IoT (Internet of Things) constrained devices to ensure secure real-time data transmission with limited resources.
Yongchao Li   +4 more
semanticscholar   +1 more source

SAT-Based Differential Analysis of the Feistel Block Cipher GRANULE

Journal of networking and network applications
Given the critical role lightweight block ciphers play in resource restricted scenarios, it is essential to rigorously evaluate their security against classical cryptanalytic methods such as differential analysis.
Ruicheng Feng   +3 more
semanticscholar   +1 more source

ALGARADI: a Hybrid SPN–Feistel Block Cipher with Dynamic Round Keys

2025 5th International Conference on Emerging Smart Technologies and Applications (eSmarTA)
With the exponential growth of digital data transmission and the increasing sophistication of cyber threats, the demand for secure and efficient encryption algorithms has become more critical than ever.
Thoyazan Sultan Algaradi
semanticscholar   +1 more source

Hybrid Encryption Algorithm Based on Feistel Network and Vigenère Cipher

2025 Eight International Conference on Vocational Education and Electrical Engineering (ICVEE)
This paper introduces a hybrid encryption algorithm that addresses the predictable key patterns, limited character support, and low diffusion inherent in the classical Vigenère cipher.
Estelito Jr. Rodrigo Medallada   +1 more
semanticscholar   +1 more source

GFLE: a low-energy lightweight block cipher based on a variant of generalized Feistel structure

Physica Scripta
Low-energy lightweight block ciphers are essential for applications with extremely resource-constrained to reduce energy and maintain security. The trade-off between diffusion property and area is a widely studied issue in the design of low-energy block ...
Min Hu, Lang Li, Xiantong Huang, Wei Sun
semanticscholar   +1 more source

Quantum Chosen-Ciphertext Attacks Against Feistel Ciphers

2019
Seminal 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.
Gembu Ito   +4 more
openaire   +3 more sources

Home - About - Disclaimer - Privacy