Results 41 to 50 of about 284 (159)
This paper proposes a DNA‐Dynamic Concurrent Permutation‐Diffusion Algorithm (DNA‐DCP‐DA) for secure image encryption, employing novel scaling chaotification models and advanced noncommutative DNA operations to address weaknesses in existing systems.
Mustafa Kamil Khairullah +5 more
wiley +1 more source
A Method of Ultra-Large-Scale Matrix Inversion Using Block Recursion
Ultra-large-scale matrix inversion has been applied as the fundamental operation of numerous domains, owing to the growth of big data and matrix applications.
HouZhen Wang, Yan Guo, HuanGuo Zhang
doaj +1 more source
A New Method for Constructing Integral‐Resistance Matrix for 5‐Round AES
A powerful theory for evaluating block ciphers against integral distinguishers was introduced by Hebborn et al. at ASIACRYPT 2021. To show the integral‐resistance property for a block cipher, their core idea is to construct a full‐rank integral‐resistance matrix. However, their method does not work practically for 5‐round AES due to the large S‐box and
Fanyang Zeng, Tian Tian, Qichun Wang
wiley +1 more source
Multiset-Algebraic Cryptanalysis of Reduced Kuznyechik, Khazad, and secret SPNs
We devise the first closed formula for the number of rounds of a blockcipher with secret components so that these components can be revealed using multiset, algebraic-degree, or division-integral properties, which in this case are equivalent.
Alex Biryukov +2 more
doaj +1 more source
Cryptanalysis on Two Kinds of Number Theoretic Pseudo‐Random Generators Using Coppersmith Method
Pseudo‐random number generator (PRNG) is a type of algorithm that generates a sequence of random numbers using a mathematical formula, which is widely used in computer science, such as simulation, modeling applications, data encryption, et cetera. The efficiency and security of PRNG are closely related to its output bits at each iteration.
Ran Zhang +4 more
wiley +1 more source
Preimage attacks on reduced‐round Keccak hash functions by solving algebraic systems
In this paper, improved preimage attacks are presented on 3‐round Keccak‐256 and Keccak‐512 and 4‐round Keccak‐256 based on algebraic methods. The authors propose some new properties about the components of Keccak permutation, reconsider the existing ...
Junling Pei, Lusheng Chen
doaj +1 more source
Constructing Efficient Identity‐Based Signatures on Lattices
In this work, we explore the recent developments related to lattice‐based signature and preimage sampling, and specify a compact identity‐based signature (IBS) on an ideal lattice for practical use. Specifically, we first propose an ellipsoid version of the G + G signature scheme (Asiacrypt 2023) that achieves slightly better signature size and higher ...
Huiwen Jia +4 more
wiley +1 more source
Influence of the Linear Layer on the Algebraic Degree in SP-Networks
We consider SPN schemes, i.e., schemes whose non-linear layer is defined as the parallel application of t ≥ 1 independent S-Boxes over F2n and whose linear layer is defined by the multiplication with a (n · t) × (n · t) matrix over F2.
Carlos Cid +5 more
doaj +1 more source
A Fast Search Method for 3‐Share Second‐Order Masking Schemes for Lightweight S‐Boxes
Masking schemes are widely adopted strategies for countering side‐channel analysis (SCA) attacks. The initial hardware masking strategy, threshold implementation (TI), provides robust security against glitches in hardware platforms. The minimum number of shares required for a TI scheme depends not only on the desired security order but also on the ...
Yanhong Fan +4 more
wiley +1 more source
Algebraic Precomputations in Differential Cryptanalysis
Algebraic cryptanalysis is a general tool which permits one to assess the security of a wide range of cryptographic schemes. Algebraic techniques have been successfully applied against a number of multivariate schemes and stream ciphers. Yet, their feasibility against block ciphers remains the source of much speculation.
Albrecht, Martin +4 more
openaire +14 more sources

