Results 11 to 20 of about 499 (157)

Second Preimage Attacks on Dithered Hash Functions [PDF]

open access: yes, 2008
We develop a new generic long-message second preimage attack, based on combining the techniques in the second preimage attacks of Dean [8] and Kelsey and Schneier [16] with the herding attack of Kelsey and Kohno [15]. We show that these generic attacks apply to hash functions using the Merkle-Damgård construction with only slightly more work than the ...
Elena Andreeva 0001   +6 more
openaire   +5 more sources

Preimage Attacks on Reduced Troika with Divide-and-Conquer Methods [PDF]

open access: yesIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2019
Troika is a recently proposed sponge-based hash function for IOTA’s ternary architecture and platform, which is developed by CYBERCRYPT. In this paper, we introduce the preimage attack on 2 and 3 rounds of Troika with a divide-and-conquer approach. Instead of directly matching a given hash value, we propose equivalent conditions to determine whether a ...
LIU, Fukang, ISOBE, Takanori
openaire   +3 more sources

New Preimage Attacks against Reduced SHA-1 [PDF]

open access: yes, 2012
This paper shows preimage attacks against reduced SHA-1 up to 57 steps. The best previous attack has been presented at CRYPTO 2009 and was for 48 steps finding a two-block preimage with incorrect padding at the cost of $$2^{159.3}$$ evaluations of the compression function.
Simon Knellwolf, Dmitry Khovratovich
openaire   +4 more sources

Automatic Preimage Attack Framework on Ascon Using a Linearize-and-Guess Approach [PDF]

open access: yes, 2023
Ascon is the final winner of the lightweight cryptography standardization competition (2018 − 2023). In this paper, we focus on preimage attacks against round-reduced Ascon.
Weidong Qiu   +9 more
core   +2 more sources

Allocating Rotational Cryptanalysis based Preimage Attack on 4-round Keccak-224 for Quantum Setting [PDF]

open access: yes, 2022
In this paper, we aim to present a quantum setting oriented preimage attack against 4-round Keccak-224. An important technique we called the allocating rotational cryptanalysis takes the preimage attack into the situation of 2-block preimage recovery ...
Juntao Gao   +4 more
core  

On quantum preimage attacks.

open access: yesCoRR, 2014
We propose a preimage attack against cryptographic hash functions based on the speedup enabled by quantum computing. Preimage resistance is a fundamental property cryptographic hash functions must possess. The motivation behind this work relies in the lack of conventional attacks against newly introduced hash schemes such as the recently elected SHA-3 ...
openaire   +3 more sources

A second preimage attack on zipper hash

open access: yesSecurity and Communication Networks, 2015
AbstractThe zipper hash utilizes two‐pass hashing to strengthen the iterated hash functions against the generic attack. In this paper, we analyze the features of zipper hash and several existing generic attacks on hash functions. A new tree structure called inverse‐diamond, which starts from one fixed point and ends with many points, is exploited to ...
Shiwei Chen, Chenhui Jin
openaire   +1 more source

Pseudoaneurysms as a complication of stereoelectroencephalography: Case series and clinical recommendations

open access: yesEpilepsia, Volume 67, Issue 3, Page 1193-1205, March 2026.
Abstract Objective Stereoelectroencephalography (sEEG) is commonly employed in the workup for epilepsy surgery in patients with focal drug‐resistant epilepsy (DRE). Intracranial hemorrhage is a known complication, with reported incidence rates ranging from .9% to 19.1%. Rarely, pseudoaneurysms have been reported in literature as a potential cause. This
Youssra El Khou   +35 more
wiley   +1 more source

Dimer models and conformal structures

open access: yesCommunications on Pure and Applied Mathematics, Volume 79, Issue 2, Page 340-446, February 2026.
Abstract Dimer models have been the focus of intense research efforts over the last years. Our paper grew out of an effort to develop new methods to study minimizers or the asymptotic height functions of general dimer models and the geometry of their frozen boundaries.
Kari Astala   +3 more
wiley   +1 more source

Parallel Algorithm for Approximate State Graph Exploration With Restricted Memory Footprint

open access: yesConcurrency and Computation: Practice and Experience, Volume 38, Issue 1, January 2026.
ABSTRACT We investigate the performance of algorithms that explore large state graphs of finite state machines without input by following paths. To improve on anchor‐based and candidate‐based explorations and to avoid the performance overhead of full anchor lists and the tuning sensitivity of timeout‐based methods, we propose and analyze exploration ...
Jörg Keller, Sebastian Litzinger
wiley   +1 more source

Home - About - Disclaimer - Privacy