Results 161 to 170 of about 585 (189)

Secure Quaternion Feistel Cipher for DICOM Images

IEEE Transactions on Image Processing, 2019
An improved and extended version of a quaternion-based lossless encryption technique for digital image and communication on medicine (DICOM) images is proposed. We highlight and address several security flaws present in the previous version of the algorithm originally proposed by Dzwonkowski et al. (2015).
Mariusz Dzwonkowski, Roman Rykaczewski
openaire   +2 more sources

SCENERY: a lightweight block cipher based on Feistel structure

Frontiers of Computer Science, 2021
In this paper, we propose a new lightweight block cipher called SCENERY. The main purpose of SCENERY design applies to hardware and software platforms. SCENERY is a 64-bit block cipher supporting 80-bit keys, and its data processing consists of 28 rounds. The round function of SCENERY consists of 8 4 × 4 S-boxes in parallel and a 32 × 32 binary matrix,
Jingya Feng, Lang Li 0002
openaire   +1 more source

Improved Integral Attack on Generalized Feistel Cipher

2020
Division property is a generalized integral property proposed by Todo in Eurocrypt 2015. Utilizing automated tools such as SAT and MILP, the complexity to search for integral distinguisher by division property was greatly reduced. Based on division property and automated tools, Derbez et al.
Zhichao Xu, Hong Xu, Xuejia Lai
openaire   +1 more source

A chaos-based block cipher with Feistel structure

2014 IEEE 13th International Conference on Cognitive Informatics and Cognitive Computing, 2014
In 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 0008, Liang Lei, Qi Han 0004, Rong Jia   +3 more
openaire   +1 more source

Generic Attacks on Generalized Feistel Ciphers

2017
Type-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).
Jacques Patarin, Emmanuel Volte, Benoît Cogliati   +2 more
openaire   +1 more source

Generic Attacks on Classical Feistel Ciphers

2017
In this chapter, we will give a complete description of best known attacks on classical Feistel ciphers.
Jacques Patarin, Emmanuel Volte, Benoît Cogliati   +2 more
openaire   +1 more source

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, Emmanuel Volte, Benoît Cogliati   +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, Emmanuel Volte, Benoît Cogliati   +2 more
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

Swarm intelligence algorithms in cryptanalysis of simple Feistel ciphers

International Journal of Information and Communication Technology, 2018
Recent cryptosystems constitute a hard task for cryptanalysis algorithms due to the nonlinearity of their structure. This problem can be formulated as NP-hard. It has long been subject to various attacks; related results remain insufficient especially when handling wide instances due to resources requirement which increase with the size of the problem.
Tahar Mekhaznia, Abdelmadjid Zidani
exaly   +2 more sources