Results 81 to 90 of about 4,428,130 (204)
Many lightweight block ciphers have been proposed for IoT devices that have limited resources. SLIM, LBC‐IoT, and SLA are lightweight block ciphers developed for IoT systems. The designer of SLIM presented a 7‐round differential distinguisher and an 11‐round linear trail using a heuristic method. We have comprehensively sought the longest distinguisher
Nobuyuki Sugio, Qichun Wang
wiley +1 more source
SAT-Based Security Evaluation for WARP against Linear Cryptanalysis
WARP, an efficient lightweight block cipher presented by Banik et al., offers a viable alternative to AES with its 128-bit block and a 128-bit key.
Jiali Shi, Guoqiang Liu, Chao Li
doaj +1 more source
A New (Related‐Key) Neural Distinguisher Using Two Differences for Differential Cryptanalysis
At CRYPTO 2019, Gohr showed the significant advantages of neural distinguishers over traditional distinguishers in differential cryptanalysis. At fast software encryption (FSE) 2024, Bellini et al. provided a generic tool to automatically train the (related‐key) differential neural distinguishers for different block ciphers. In this paper, based on the
Gao Wang +3 more
wiley +1 more source
Diffusion Analysis of a Scalable Feistel Network
A generalization of the concepts of Feistel Networks (FN), known as Extended Feistel Network (EFN) is examined. EFN splits the input blocks into n > 2 sub-blocks.
Mohd Aizaini Maarof, Subariah Ibrahim
core +1 more source
Comparing Cryptographic Algorithms in Scalable Feistel Networks [PDF]
Scalability of symmetric cipher is still not asnatural as for public-key cryptosystems. Most of thecurrent block ciphers do not support freely variableblock and key lengths.
Myo, Khin Yupar
core +1 more source
Optimized SM4 Hardware Implementations for Low Area Consumption
The SM4 block cipher is standardized in ISO/IEC, and it is also the national standard of commercial cryptography in China. In this paper, we propose two new techniques called “split‐and‐join” and “off‐peak and stagger” to make SM4 more applicable to resource‐constrained environments.
Ruolin Zhang +5 more
wiley +1 more source
Superposition Attacks on Pseudorandom Schemes Based on Two or Less Permutations
We study quantum superposition attacks against permutation‐based pseudorandom cryptographic schemes. We first extend Kuwakado and Morii’s attack against the Even–Mansour cipher and exhibit key recovery attacks against a large class of pseudorandom schemes based on a single call to an n‐bit permutation, with polynomial O(n) (or O(n2), if the concrete ...
Shaoxuan Zhang +3 more
wiley +1 more source
Indifferentiability of 8-Round Feistel Networks [PDF]
We prove that a balanced 8-round Feistel network is indifferentiable from a random permutation. This result comes on the heels of (and is part of the same body of work as) a 10-round indifferentiability result for Feistel network recently announced by ...
John Steinberger, Yuanxi Dai
core +1 more source
Generalized birthday attacks on unbalanced Feistel networks [PDF]
Unbalanced Feistel networks F k which are used to construct invertible pseudo-random permutations from kn bits to kn bits using d pseudo-random functions from n bits to (k − l)n bits, k ≥ 2 are studied. We show a new generalized birthday attack on F k , with d ≤ 3k − 3.
openaire +2 more sources
Enhancing Image Cryptography Performance with Block Left Rotation Operations
In today’s interconnected world, the transmission of both lengthy and concise text messages is ubiquitous across diverse communication platforms. With the proliferation of sensitive and specialized information being exchanged, safeguarding these messages from potential threats such as intruders, abusers, and data hackers becomes imperative.
Mohammad Subhi Al-Batah +4 more
wiley +1 more source

