Results 11 to 20 of about 2,808 (186)

New Conditional Cube Attack on Keccak Keyed Modes

IACR Transactions on Symmetric Cryptology, 2019
The conditional cube attack on round-reduced Keccak keyed modes was proposed by Huang et al. at EUROCRYPT 2017. In their attack, a conditional cube variable was introduced, whose diffusion was significantly reduced by certain key bit conditions.
Zheng Li, Xiaoyang Dong, Wenquan Bi, Keting Jia, Xiaoyun Wang, Willi Meier   +5 more
doaj   +4 more sources

Tanda tangan Digital Menggunakan Algoritme Keccak dan RSA

Jurnal Nasional Teknik Elektro dan Teknologi Informasi, 2016
Just like conventional signatures, digital signatures can be used to prove the authenticity of a document in digital form. In addition, digital signatures can also be used to prove the validity of the author of the document, so that the author of the ...
Rezania Agramanisti Azdy
doaj   +3 more sources

Revisiting Keccak and Dilithium Implementations on ARMv7-M

Transactions 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, Alexandre Adomnicăi, Jipeng Zhang, Wangchen Dai, Yao Liu, Ray C. C. Cheung, Çetin Kaya Koç, Donglong Chen   +7 more
doaj   +2 more sources

Preimage attacks on reduced‐round Keccak hash functions by solving algebraic systems

IET Information Security, 2023
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

Performance Analysis of Keccak f-[1600] [PDF]

International Journal of Advanced Computer Science and Applications, 2013
Keccak is the latest Hash Function selected as the winner of NIST Hash Function Competition. SHA-3 is not meant to replace SHA-2 as no significant attacks on SHA-2 have been demonstrated. But it is designed in response to the need to find an alternative and dissimilar construct for Cryptographic Hash that is more fortified to attacks.
Ananya Chowdhury, Utpal Kumar
openaire   +3 more sources

Efficient computation of hashes [PDF]

, 2014
The sequential computation of hashes at the core of many distributed storage systems and found, for example, in grid services can hinder efficiency in service quality and even pose security challenges that can only be addressed by the use of parallel ...
, Bertoni G, Bertoni G, Bertoni G, Bertoni G, Bertoni G, Bertoni G, Blelloch G E, Blum M, Coron J S, Damgard I B, Hall E, Peter R Hobson, Raul H C Lopes, Ristenpart T, Sarkar P, Virginia N L Franqueira   +16 more
core   +3 more sources

Efficient hardware implementations of high throughput SHA-3 candidates keccak, luffa and blue midnight wish for single- and multi-message hashing [PDF]

, 2010
In November 2007 NIST announced that it would organize the SHA-3 competition to select a new cryptographic hash function family by 2012. In the selection process, hardware performances of the candidates will play an important role.
Akın, Abdulkadir, Akin, Abdulkadir, Aysu, Aydın, Aysu, Aydin, Savas, Erkay, Savaş, Erkay, Ulusel, Onur Can   +6 more
core   +2 more sources

Improving security of lightweith SHA-3 against preimage attacks [PDF]

International Journal of Electronics and Telecommunications, 2018
In this article we describe the SHA-3 algorithm and its internal permutation in which potential weaknesses are hidden. The hash algorithm can be used for different purposes, such aspseudo-random bit sequences generator, key wrapping or one pass ...
Serhii Onopa, Zbigniew Kotulski
doaj   +1 more source

Improved Preimage Attacks on 4-Round Keccak-224/256

IACR Transactions on Symmetric Cryptology, 2021
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

New Attacks on Keccak-224 and Keccak-256 [PDF]

, 2012
The Keccak hash function is one of the five finalists in NIST's SHA-3 competition, and so far it showed remarkable resistance against practical collision finding attacks: After several years of cryptanalysis and a lot of effort, the largest number of Keccak rounds for which actual collisions were found was only 2.
Itai Dinur, Orr Dunkelman, Adi Shamir
openaire   +1 more source