Results 1 to 10 of about 31,711 (108)
Using Automatic Generation of Relaxation Constraints to Improve the Preimage Attack on 39-step MD4 [PDF]
arXiv, 2018 In this paper we construct preimage attack on the truncated variant of the MD4 hash function. Specifically, we study the MD4-39 function defined by the first 39 steps of the MD4 algorithm. We suggest a new attack on MD4-39, which develops the ideas proposed by H. Dobbertin in 1998.
Gribanova Irina, Semenov Alexander
arxiv +5 more sources
On quantum preimage attacks [PDF]
arXiv, 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 ...
Răzvan Roşie
arxiv +3 more sources
A Second Preimage Attack on the XOR Hash Combiner
IET Information Security, Volume 2024, Issue 1, 2024.The exclusive‐or (XOR) hash combiner is a classical hash function combiner, which is well known as a good PRF and MAC combiner, and is used in practice in TLS versions 1.0 and 1.1. In this work, we analyze the second preimage resistance of the XOR combiner underlying two different narrow‐pipe hash functions with weak ideal compression functions.
Shiwei Chen +3 more
openalex +2 more sources
Weakened Random Oracle Models with Target Prefix [PDF]
SecITC 2018, 2021 Weakened random oracle models (WROMs) are variants of the random oracle model (ROM). The WROMs have the random oracle and the additional oracle which breaks some property of a hash function. Analyzing the security of cryptographic schemes in WROMs, we can specify the property of a hash function on which the security of cryptographic schemes depends ...
arxiv +1 more source
ChainKeeper: A cross‐chain scheme for governing the chain by chain
IET Blockchain, Volume 3, Issue 4, Page 249-264, December 2023., 2023 With the rapid application of consortium chains in various industries, supervising these systems has become a challenge for governments. It is a promising way to govern the chains by a chain, but the existing cross‐chain technologies cannot support perfect supervision.
Yuwei Xu +3 more
wiley +1 more source
Perfectoid Shimura varieties and the Calegari–Emerton conjectures
Journal of the London Mathematical Society, Volume 108, Issue 5, Page 1954-2000, November 2023., 2023 Abstract We prove many new cases of a conjecture of Calegari–Emerton describing the qualitative properties of completed cohomology. The heart of our argument is a careful inductive analysis of completed cohomology on the Borel–Serre boundary. As a key input to this induction, we prove a new perfectoidness result for towers of minimally compactified ...
David Hansen, Christian Johansson
wiley +1 more source
The spectral gap of random regular graphs
Random Structures &Algorithms, Volume 63, Issue 2, Page 557-587, September 2023., 2023 Abstract We bound the second eigenvalue of random d$$ d $$‐regular graphs, for a wide range of degrees d$$ d $$, using a novel approach based on Fourier analysis. Let Gn,d$$ {G}_{n,d} $$ be a uniform random d$$ d $$‐regular graph on n$$ n $$ vertices, and λ(Gn,d)$$ \lambda \left({G}_{n,d}\right) $$ be its second largest eigenvalue by absolute value ...
Amir Sarid
wiley +1 more source
Nonnegative scalar curvature on manifolds with at least two ends
Journal of Topology, Volume 16, Issue 3, Page 855-876, September 2023., 2023 Abstract Let M$M$ be an orientable connected n$n$‐dimensional manifold with n∈{6,7}$n\in \lbrace 6,7\rbrace$ and let Y⊂M$Y\subset M$ be a two‐sided closed connected incompressible hypersurface that does not admit a metric of positive scalar curvature (abbreviated by psc). Moreover, suppose that the universal covers of M$M$ and Y$Y$ are either both spin
Simone Cecchini +2 more
wiley +1 more source
Applying Grover's Algorithm to Hash Functions: A Software Perspective [PDF]
, 2022 Quantum software frameworks provide software engineers with the tools to study quantum algorithms as applied to practical problems. We implement classical hash functions MD5, SHA-1, SHA-2, and SHA-3 as quantum oracles to study the computational resource requirements of conducting a preimage attack with Grover's Algorithm. We introduce an improvement to
arxiv +1 more source
Differential graded Koszul duality: An introductory survey
Bulletin of the London Mathematical Society, Volume 55, Issue 4, Page 1551-1640, August 2023., 2023 Abstract This is an overview on derived nonhomogeneous Koszul duality over a field, mostly based on the author's memoir L. Positselski, Memoirs of the American Math. Society 212 (2011), no. 996, vi+133. The paper is intended to serve as a pedagogical introduction and a summary of the covariant duality between DG‐algebras and curved DG‐coalgebras, as ...
Leonid Positselski
wiley +1 more source