Results 11 to 20 of about 289 (167)
Practical Preimage Attacks on 3-Round Keccak-256 and 4-Round Keccak[r=640, c=160]
Recently, linear structures and algebraic attacks have been widely used in preimage attacks on round-reduced Keccak. Inherited by pioneers’ work, we make some improvements for 3-round Keccak-256 and 4-round Keccak[r=640, c=160].
Xiaoen Lin, Le He, Hongbo Yu
doaj +2 more sources
Highly Efficient Symmetric Key Based Authentication and Key Agreement Protocol Using Keccak [PDF]
Efficient authentication and key agreement protocols between two entities are required in many application areas. In particular, for client–server type of architectures, the client is mostly represented by a constrained device and thus highly efficient ...
An Braeken
doaj +2 more sources
Revisiting Keccak and Dilithium Implementations on ARMv7-M
Keccak is widely used in lattice-based cryptography (LBC) and its impact to the overall running time in LBC scheme can be predominant on platforms lacking dedicated SHA-3 instructions. This holds true on embedded devices for Kyber and Dilithium, two LBC
Junhao Huang +7 more
doaj +2 more sources
Improved Preimage Attacks on 3-Round Keccak-224/256
In this paper, we provide an improved method on preimage attacks of standard 3-round Keccak-224/256. Our method is based on the work by Li and Sun. Their strategy is to find a 2-block preimage instead of a 1-block one by constructing the first and second
Xiaoen Lin, Le He, Hongbo Yu
doaj +1 more source
Higher-Order Differential Properties of Keccak and Luffa [PDF]
In this paper, we identify higher-order differential and zero-sum properties in the full Keccak-f permutation, in the Luffa v1 hash function and in components of the Luffa v2 algorithm. These structural properties rely on a new bound on the degree of iterated permutations with a nonlinear layer composed of parallel applications of a number of balanced ...
Boura, Christina +2 more
openaire +5 more sources
Differential Propagation Analysis of Keccak [PDF]
In this paper we introduce new concepts that help read and understand low-weight differential trails in Keccak. We then propose efficient techniques to exhaustively generate all 3-round trails in its largest permutation below a given weight. This allows us to prove that any 6-round differential trail in Keccak-f[1600] has weight at least 74.
Joan Daemen, Gilles Van Assche
openaire +2 more sources
Improved Preimage Attacks on 4-Round Keccak-224/256
This paper provides an improved preimage attack method on standard 4-round Keccak-224/256. The method is based on the work pioneered by Li and Sun, who design a linear structure of 2-round Keccak-224/256 with 194 degrees of freedom left.
Le He, Xiaoen Lin, Hongbo Yu
doaj +1 more source
Data Integrity and Security using Keccak and Digital Signature Algorithm (DSA)
Data security is a very important compilation using cloud computing; one of the research that is running and using cloud technology as a means of storage is G-Connect.
Muhammad Asghar Nazal +2 more
doaj +1 more source
Unaligned Rebound Attack: Application to Keccak [PDF]
We analyze the internal permutations of Keccak, one of the NIST SHA-3 competition finalists, in regard to differential properties. By carefully studying the elements composing those permutations, we are able to derive most of the best known differential paths for up to 5 rounds. We use these differential paths in a rebound attack setting and adapt this
Alexandre Duc +3 more
openaire +3 more sources
Preimage Attacks on the Round-reduced Keccak with Cross-linear Structures
In this paper, based on the work pioneered by Aumasson and Meier, Dinur et al., and Guo et al., we construct some new delicate structures from the roundreduced versions of Keccakhash function family. The new constructed structures are called cross-linear
Ting Li +3 more
doaj +1 more source

