Results 11 to 20 of about 1,005 (175)

Single-Trace Attacks on Keccak [PDF]

open access: yesTransactions on Cryptographic Hardware and Embedded Systems, 2020
Since its selection as the winner of the SHA-3 competition, Keccak, with all its variants, has found a large number of applications. It is, for instance, a common building block in schemes submitted to NIST’s post-quantum cryptography project. In many of
Matthias J. Kannwischer   +2 more
doaj   +9 more sources

Practical Preimage Attacks on 3-Round Keccak-256 and 4-Round Keccak[r=640, c=160] [PDF]

open access: yesIACR Transactions on Symmetric Cryptology
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   +6 more sources

Impeccable Keccak [PDF]

open access: yesTransactions on Cryptographic Hardware and Embedded Systems
The standardization of the hash-based digital signature scheme SPHINCS+ proceeds faster than initially expected. This development seems to be welcomed by practitioners who appreciate the high confidence in SPHINCS+’s security assumptions and its ...
Ivan Gavrilan   +4 more
doaj   +5 more sources

Revisiting Keccak and Dilithium Implementations on ARMv7-M [PDF]

open access: yesTransactions on Cryptographic Hardware and Embedded Systems
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   +4 more sources

Rotational Cryptanalysis of Round-Reduced Keccak [PDF]

open access: yes, 2014
In this paper we attack round-reduced Keccak hash function with a technique called rotational cryptanalysis. We focus on Keccak variants proposed as SHA-3 candidates in the NIST’s contest for a new standard of cryptographic hash function. Our main result is a preimage attack on 4-round Keccak and a 5-round distinguisher on Keccak-\(f\)[1600 ...
Pawel Morawiecki   +2 more
core   +7 more sources

Malicious Keccak. [PDF]

open access: yesIACR Cryptol. ePrint Arch., 2015
In this paper, we investigate Keccak --- the cryptographic hash function adopted as the SHA-3 standard. We propose a malicious variant of the function, where new round constants are introduced.
Pawel Morawiecki
core   +3 more sources

Higher-Order Side-Channel Protected Implementations of KECCAK [PDF]

open access: yes2017 Euromicro Conference on Digital System Design (DSD), 2017
The efficient protection of security critical devices against side-channel analysis attacks is a fundamental need in the age of Internet of Things and ubiquitous computing. In this work, we introduce a configurable hardware design of KECCAK (SHA-3) which can be tailored to fulfill the needs of a wide range of different applications.
Gross, Hannes   +2 more
core   +5 more sources

New Techniques for Searching Differential Trails in Keccak

open access: yesIACR Transactions on Symmetric Cryptology, 2020
Keccak-f is the permutation used in the NIST SHA-3 hash function standard. Inspired by the previous exhaustive differential trail search methods by Mella et al.
Guozhen Liu, Weidong Qiu, Yi Tu
doaj   +4 more sources

Unaligned Rebound Attack: Application to Keccak [PDF]

open access: yes, 2012
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   +6 more sources

Ascon-Keccak AEAD Algorithm. [PDF]

open access: yesIACR Cryptol. ePrint Arch.
The Ascon specification defines among others an encryption scheme offering authenticated encryption with associated data (AEAD) which is based on a duplex mode of a sponge. With that it is the first of such algorithm selected and about to be standardized
Stephan Müller
core   +3 more sources

Home - About - Disclaimer - Privacy