Results 51 to 60 of about 205 (141)

A New (Related‐Key) Neural Distinguisher Using Two Differences for Differential Cryptanalysis

IET Information Security, Volume 2024, Issue 1, 2024.
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, Gaoli Wang, Siwei Sun, Qichun Wang   +3 more
wiley   +1 more source

Optimized SM4 Hardware Implementations for Low Area Consumption

IET Information Security, Volume 2024, Issue 1, 2024.
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, Zejun Xiang, Shasha Zhang, Xiangyong Zeng, Min Song, Bohui Wang   +5 more
wiley   +1 more source

Superposition Attacks on Pseudorandom Schemes Based on Two or Less Permutations

IET Information Security, Volume 2024, Issue 1, 2024.
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, Chun Guo, Qingju Wang, Helena Rifà-Pous   +3 more
wiley   +1 more source

An Efficient Ontology‐Based Semantic Interoperability Using MSGO‐RNN in Cloud Computing

Journal of Optimization, Volume 2024, Issue 1, 2024.
Semantic interoperability (SI) is defined as the capability of interpreting the nature of the information exchanged inside cloud computing (CC). For SI, ontology is selected as a solution. A hierarchical structure is offered by an ontology that comprises semantic relations between the application and the cloud server (CS). Even though different methods
Chithambaramani R., Jayashree K., Krishna B. V., Prakash Mohan, Tayfun Dede   +4 more
wiley   +1 more source

Constructing Zero-Sum Distinguishers of Two Generalized Feistel Structures

, 2015
由于Feistel结构具有良好的密码学性质, 它的变体许多广义Feistel结构也成为密码算法设计者乐于选择的对象, 其中由郑玉良等人设计的type-2和type-3广义Feistel结构被许多分组密码算法和密码杂凑函数所采用. 所以, 对这两种广义Feistel结构进行安全性分析非常必要. 伪随机性是一个结构的重要安全性指标, 而自2007年Knudsen和Rijmen提出了已知密钥区分器开始, 利用构造已知密钥区分器来分析算法与结构的伪随机性逐步成为人们常用的手段.
李艳俊, 吴文玲, 邹剑, 董乐, 杜蛟   +4 more
core  

Generalized Feistel Ciphers for Efficient Prime Field Masking - Full Version [PDF]

A recent work from Eurocrypt 2023 suggests that prime-field masking has excellent potential to improve the efficiency vs. security tradeoff of masked implementations against side-channel attacks, especially in contexts where physical leakages show low ...
François-Xavier Standaert, Lorenzo Grassi, Thorben Moos, Loïc Masure, Pierrick Méaux   +4 more
core  

Parallelizing the Camellia and SMS4 Block Ciphers - Extended version [PDF]

, 2010
The n-cell GF-NLFSR (Generalized Feistel-NonLinear Feedback Shift Register) structure [8] is a generalized unbalanced Feistel network that can be considered as a generalization of the outer function FO of the KASUMI block cipher.
Axel Poschmann, Huihui Yap, Khoongming Khoo   +2 more
core  

Shining Light on the Shadow: Full-round Practical Distinguisher for Lightweight Block Cipher Shadow [PDF]

, 2023
Shadow is a lightweight block cipher proposed at IEEE IoT journal 2021. Shadow’s main design principle is adopting a variant 4- branch Feistel structure in order to provide a fast diffusion rate.
Hanbeom Shin, Myoungsu Shin, Deukjo Hong, Insung Kim, Seokhie Hong, Seonkyu Kim, Dongjae Lee, Donggeun Kwon, Jaechul Sung, Sunyeop Kim, Seonggyeom Kim   +10 more
core  

Cryptanalysis of reduced QTL block cipher

, 2017
Recently, a new ultra lightweight block cipher called QTL has been proposed. The authors claim to achieve a fast diffusion in QTL by using a new variant of a generalized Feistel network structure that changes all block messages in one iterative round in ...
Bagheri, Nasour,, Sadegh Sadeghi, Mohamed Ahmed Abdelraheem, Abdelraheem, Mohamed Ahmed,, Nasour Bagheri, Sadeghi, Sadegh,   +5 more
core   +1 more source

On generalizations of the Lai-Massey scheme [PDF]

In this paper, we re-investigate the Lai-Massey scheme, originally proposed in the cipher IDEA. Due to the similarity with the Feistel networks, and due to the existence of invariant subspace attacks as originally pointed out by Vaudenay at FSE 1999, the
Lorenzo Grassi
core   +2 more sources