Results 201 to 210 of about 3,739 (238)
Some of the next articles are maybe not open access.

Mind the Faulty Keccak: A Practical Fault Injection Attack Scheme Applied to All Phases of ML-KEM and ML-DSA

IEEE Transactions on Information Forensics and Security
ML-KEM and ML-DSA are NIST-standardized lattice-based post-quantum cryptographic algorithms. In both algorithms, Keccak is the designated hash algorithm extensively used for deriving sensitive information, making it a valuable target for attackers.
Yuxuan Wang   +6 more
semanticscholar   +1 more source

A Lightweight Unified Keccak Module for Efficient Hashing in ML-KEM and ML-DSA

Proceedings of the 2025 Quantum Security and Privacy Workshop
One of the major modules used in post-quantum cryptographic (PQC) algorithms is Keccak or SHA-3. For generating the coefficients of the public vector, secret vector, and error vector, different sampler functions receive the output of the Keccak function ...
Suraj Mandal, Debapriya Basu Roy
semanticscholar   +1 more source

Algebraic Attacks on Round-Reduced Keccak

2021
Since Keccak was selected as the SHA-3 standard, both its hash mode and keyed mode have attracted lots of third-party cryptanalysis. Especially in recent years, there is progress in analyzing the collision resistance and preimage resistance of round-reduced Keccak.
Fukang Liu   +3 more
openaire   +1 more source

RISC-V Based Keccak Co-Processor for NIST Post-Quantum Cryptography Standards

International Symposium on Circuits and Systems
This paper presents the design and implementation of a RISC-V-based Keccak co-processor optimized for Post-Quantum Cryptography (PQC) algorithms.
Alessandra Dolmeta   +4 more
semanticscholar   +1 more source

An Extended Grendel Approach Applied to Blockchain Signature as an Alternative to Keccak Permutation

Statistics, Optimization & Information Computing
In this paper, we present our own developed programming which helps to generate a sponge-based function while avoiding any call from hashing libraries. Then, we try to implement it in a blockchain signature by getting inspired from Keccak methods such as
Abdelkarim Lkoaiza   +3 more
semanticscholar   +1 more source

Practical Analysis of Reduced-Round Keccak

2011
Keccak is a finalist of the SHA-3 competition. In this paper we propose a practical distinguisher on 4 rounds of the hash function with the submission parameters. Recently, the designers of Keccak published several challenges on reduced versions of the hash function. With regard to this, we propose a preimage attack on 2 rounds, a collision attack on 2
Naya-Plasencia, María   +3 more
openaire   +4 more sources

Securing Financial Transactions in Blockchain Networks Using Keccak 256 Hashing Algorithm

International Conference on Cryptography, Security and Privacy
Ensuring the security of financial transactions in blockchain networks necessitates strong, fast, and dependable hashing methods. Keccak-256, the fundamental algorithm of the SHA-3 standard, offers robust cryptographic resilience, guaranteeing safe ...
Thirupurasundari Chandrasekaran   +5 more
semanticscholar   +1 more source

Skup kriptografskih algoritama grupe Keccak [PDF]

open access: possible, 2021
U završnom radu su opisani algoritmi uključeni u slobodno dostupni programski paket EXtended Keccak Code Package (XKCP). Izrađena je i objašnjena programska implementacija za ispitivanje i prikaz rada algoritama za računanje sažetaka sadržanih u normama FIPS 202 i NIST SP 800-185 koje je ostvarila grupa Keccak.
openaire   +1 more source

Side-Channel Analysis of MAC-Keccak

2013 IEEE International Symposium on Hardware-Oriented Security and Trust (HOST), 2013
NIST recently completed the SHA-3 competition with the selection of Keccak as the new standard for crypto-graphic hashing. In this paper, we present a comprehensive Side-Channel Analysis of Keccak, when it is used with a secret key to generate a Message Authentication Code (MAC) (MAC-Keccak). Our analysis covers all the variations of the algorithm.
Mostafa Taha, Patrick Schaumont
openaire   +1 more source

Cryptanalysis of 1-Round KECCAK

2018
In this paper, we give the first pre-image attack against 1-round KECCAK-512 hash function, which works for all variants of 1-round KECCAK. The attack gives a preimage of length less than 1024 bits by solving a system of 384 linear equations. We also give a collision attack against 1-round KECCAK using similar analysis.
Rajendra Kumar   +2 more
openaire   +1 more source

Home - About - Disclaimer - Privacy