Results 41 to 50 of about 499 (157)
On the Collision and Preimage Resistance of Certain Two-Call Hash Functions
, 2010 In this paper we present concrete collision and preimage attacks on a large class of compression function constructions making two calls to the underlying ideal primitives.
Søren S. Thomsen +8 more
core +1 more source
International Consensus Statement on Allergy and Rhinology: Sinonasal Tumors
International Forum of Allergy &Rhinology, Volume 14, Issue 2, Page 149-608, February 2024.Abstract Background Sinonasal neoplasms, whether benign and malignant, pose a significant challenge to clinicians and represent a model area for multidisciplinary collaboration in order to optimize patient care. The International Consensus Statement on Allergy and Rhinology: Sinonasal Tumors (ICSNT) aims to summarize the best available evidence and ...
Edward C. Kuan +158 more
wiley +1 more source
Preimage Attack on Hashing with Polynomials proposed at ICISC\u2706 [PDF]
, 2006 In this paper, we suggest a preimage attack on Hashing with Polynomials \cite{Shpilrain06b}. The algorithm has $n$-bit hash output and $n$-bit intermediate state. (for example, $n=163$).
Donghoon Chang
core
Tight Preimage Resistance of the Sponge Construction [PDF]
, 2022 The cryptographic sponge is a popular method for hash function design. The construction is in the ideal permutation model proven to be indifferentiable from a random oracle up to the birthday bound in the capacity of the sponge. This result in particular
Charlotte Lefevre, Bart Mennink
core
Phase diagram and topological expansion in the complex quartic random matrix model
Communications on Pure and Applied Mathematics, Volume 77, Issue 2, Page 1405-1485, February 2024.Abstract We use the Riemann–Hilbert approach, together with string and Toda equations, to study the topological expansion in the quartic random matrix model. The coefficients of the topological expansion are generating functions for the numbers Nj(g)$\mathcal {N}_j(g)$ of 4‐valent connected graphs with j vertices on a compact Riemann surface of genus g.
Pavel Bleher +2 more
wiley +1 more source
(Pseudo) Preimage Attack on Round-Reduced Grøstl Hash Function and Others (Extended Version) [PDF]
, 2012 The Grøstl hash function is one of the 5 final round candidates of the SHA-3 competition hosted by NIST. In this paper, we study the preimage resistance of the Grøstl hash function.
Shuang Wu +5 more
core
Deciding Irreducibility/Indecomposability of Feedback Shift Registers Is NP‐Hard
IET Information Security, Volume 2024, Issue 1, 2024.Feedback shift registers (FSRs) are used as a fundamental component in electronics and confidential communication. A FSR f is said to be reducible if all the output sequences of another FSR g can also be generated by f and the FSR g costs less memory than f.
Lin Wang, Guowen Xu
wiley +1 more source
Preimage Attack on Parallel FFT-Hashing
, 2008 Vaudenay in 1993. The function is a simple and light weight hash algorithm with 128-bit digest. Its basic component is a multi-permutation which helps in proving its resistance to collision attacks.
Abstract Parallel +2 more
core
Practical (Second) Preimage Attacks on TCS_SHA-3 [PDF]
, 2013 TCS\_SHA-3 is a family of four cryptographic hash functions that are covered by an US patent (US 2009/0262925). The digest sizes are 224, 256, 384 and 512 bits.
Gautham Sekar, Soumyadeep Bhattacharya
core
Distinguishing Attack and Second-Preimage Attack on the CBC-like MACs [PDF]
, 2009 In this paper, we first present a new distinguisher on the CBC-MAC based on a block cipher in Cipher Block Chaining (CBC) mode. It can also be used to distinguish other CBC-like MACs from random functions. The main results of this paper are on the second-
Keting Jia +3 more
core