Results 41 to 50 of about 416,985 (179)
Preimage Attacks on Reduced Tiger and SHA-2 [PDF]
, 2009 This paper shows new preimage attacks on reduced Tiger and SHA-2. Indesteege and Preneel presented a preimage attack on Tiger reduced to 13 rounds (out of 24) with a complexity of 2128.5. Our new preimage attack finds a one-block preimage of Tiger reduced to 16 rounds with a complexity of 2161. The proposed attack is based on meet-in-the-middle attacks.
Takanori Isobe 0001, Kyoji Shibutani
openaire +2 more sources
Dimer models and conformal structures
Communications 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
Low-weight Pseudo Collision Attack on Shabal and Preimage Attack on Reduced Shabal-512 [PDF]
, 2010 This paper studies two types of attacks on the hash function Shabal. The first attack is a low-weight pseudo collision attack on Shabal. Since a pseudo collision attack is trivial for Shabal, we focus on a low-weight pseudo collision attack.
Taizo Shirai, Takanori Isobe
core +1 more source
Parallel Algorithm for Approximate State Graph Exploration With Restricted Memory Footprint
Concurrency 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
Differential-Aided Preimage Attacks On Round-Reduced Keccak
The Computer Journal, 2022 Abstract At FSE 2008, Leurent introduced the preimage attack on MD4 by exploiting differential trails. In this paper, we apply the differential-aided preimage attack to Keccak with the message modification techniques. Instead of directly finding the preimage, we exploit differential characteristics to modify the messages, so that the ...
Congming Wei +4 more
openaire +1 more source
IET Blockchain, Volume 6, Issue 1, January/December 2026.This article talks about blockEHR Healthcare providers can validate raw physiological data with the help of IoMT devices and edge computing role‐based access control (RBAC). ABSTRACT In centralized systems prone to data breaches and single points of failure, issues about security, privacy, scalability, and real‐time sharing of electronic health records
R. Rajakarthik +2 more
wiley +1 more source
Preimage Attack on Parallel FFT-Hashing [PDF]
, 2007 Parallel FFT-Hashing was designed by C. P. Schnorr and S. Vaudenay in 1993. The function is a simple and light weight hash algorithm with 128-bit digest.
Donghoon Chang
core +1 more source
Journal of King Saud University: Computer and Information Sciences, 2020 Data Integrity is one of the primary concepts in information security. The main task of the cryptographic hash function is to assure the integrity of the transmitted data.
Mishal Almazrooie +5 more
doaj +1 more source
IET Communications, Volume 20, Issue 1, January/December 2026.This paper presents a lightweight mutual authentication protocol for VANETs that integrates SDN, edge computing, and ECC to achieve low‐latency, scalable, and privacy‐preserving vehicle communication. The proposed system reduces authentication delay and computational overhead while supporting batch verification and conditional identity traceability ...
Adi El‐Dalahmeh, Layla Albdour
wiley +1 more source
New Preimage Attacks against Reduced SHA-1 [PDF]
, 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 +2 more sources