Results 51 to 60 of about 1,691,785 (320)

Improved preimage and pseudo-collision attacks on SM3 hash function

Tongxin xuebao, 2018
A preimage attack on 32-step SM3 hash function and a pseudo-collision attack on 33-step SM3 hash function respectively were shown.32-step preimage attack was based on the differential meet-in-the-middle and biclique technique,while the previously known ...
Jian ZOU, Le DONG
doaj   +2 more sources

Investigating the Avalanche Effect of Various Cryptographically Secure Hash Functions and Hash-Based Applications

IEEE Access, 2022
In modern cryptography, hash functions are considered as one of the key components for secure communication. They play a vital role in a wide range of applications such as ensuring the authentication and integrity of the data, in forensic investigation ...
Darshana Upadhyay, Nupur Gaikwad, Marzia Zaman, Srinivas Sampalli   +3 more
doaj   +1 more source

Quantum-secure message authentication via blind-unforgeability [PDF]

, 2020
Formulating and designing unforgeable authentication of classical messages in the presence of quantum adversaries has been a challenge, as the familiar classical notions of unforgeability do not directly translate into meaningful notions in the quantum ...
CH Bennett, D Boneh, D Boneh, D Unruh, D Unruh, F Song, G Alagic, M Hayashi, M Kaplan, M Zhandry, M Zhandry, PW Shor, R Cramer, S Aaronson, S Garg, T Gagliardoni, T Santoli, W Forrest Stinespring   +17 more
core   +3 more sources

Search framework for neutral bits and boomerangs in SHA‐1 collision attacks

IET Information Security, 2023
Neutral bits and boomerangs are key techniques for accelerating collision search in SHA‐1 attacks. The current acceleration techniques for SHA‐1 near‐collision attacks are reviewed and a generic search framework for neutral bits and boomerangs is ...
Degang Li, Yang Yang, Guang Zeng
doaj   +1 more source

Collision Attacks Against CAESAR Candidates

, 2015
In this paper we study authenticated encryption algorithms inspired by the OCB mode (Offset Codebook). These algorithms use secret offsets (masks derived from a whitening key) to turn a block cipher into a tweakable block cipher, following the XE or XEX construction.
Fuhr, Thomas, Leurent, Gaëtan, Suder, Valentin   +2 more
openaire   +2 more sources

Preimage and pseudo collision attacks on round-reduced DHA-256 hash function

Tongxin xuebao, 2013
A preimage attack on DHA-256 hash function reduced to 37-round and a pseudo collision attack on the func-tion reduced to 39-round were proposed respectively.Based on the meet-in-the-middle attack,the Biclique technique was used to improve the preimage ...
Jian ZOU, Wen-ling WU, Shuang WU, Le DONG   +3 more
doaj   +2 more sources

Random Oracles in a Quantum World [PDF]

, 2011
The interest in post-quantum cryptography - classical systems that remain secure in the presence of a quantum adversary - has generated elegant proposals for new cryptosystems.
C.H. Bennett, D. Boneh, D. Cash, D. Pointcheval, D. Unruh, E. Fujisaki, E. Fujisaki, G. Brassard, G. Brassard, J. Watrous, J.-S. Coron, L.K. Grover, M. Fischlin, N.H. Bshouty, O. Goldreich, P. Shor, P.-L. Cayrel, R.A. Servedio, S. Aaronson, S. Agrawal, S. Agrawal, S. Goldwasser, S. Hallgren, S.D. Gordon, X. Boyen, Y. Dodis   +25 more
core   +3 more sources

A Collision Attack on a Double-Block-Length Compression Function Instantiated with 8-/9-Round AES-256

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences, 2016
This paper presents the first non-trivial collision attack on the double-block-length compression function presented at FSE 2006 instantiated with round-reduced AES-256: \(f_0(h_0\Vert h_1,M)\Vert f_1(h_0\Vert h_1,M)\) such that $$\begin{aligned} f_0 ...
Jiageng Chen, Shoichi Hirose, H. Kuwakado, A. Miyaji   +3 more
semanticscholar   +1 more source

Quantum Lightning Never Strikes the Same State Twice [PDF]

, 2017
Public key quantum money can be seen as a version of the quantum no-cloning theorem that holds even when the quantum states can be verified by the adversary.
B Barak, C Gentry, CH Bennett, CH Bennett, D Boneh, D Boneh, D Micciancio, D Unruh, D Unruh, J Ding, J-S Coron, MC Pena, MR Albrecht, R Cramer, S Garg, S Garg, S Wiesner, Y Chen   +17 more
core   +2 more sources

A Meaningful MD5 Hash Collision Attack [PDF]

, 2006
It is now proved by Wang et al., that MD5 hash is no more secure, after they proposed an attack that would generate two different messages that gives the same MD5 sum. Many conditions need to be satisfied to attain this collision.
Kashyap, Narayana D.
core   +1 more source