相关论文: 22-Step Collisions for SHA-2
A detailed study of correlated scalars, produced in collisions of nuclei and associated with the $\sigma$-field fluctuations, $(\delta \sigma)^2= < \sigma^2 >$, at the QCD critical point (critical fluctuations), is performed on the basis of…
In this paper we produce the first known formula for cohomologies of the derived tensor products of structure sheaves of subschemes in the case where the intersection of the subschemes is not a local complete intersection. The case covered…
We introduce a geometry of interaction model for Mazza's multiport interaction combinators, a graph-theoretic formalism which is able to faithfully capture concurrent computation as embodied by process algebras like the $\pi$-calculus. The…
In a recent paper, Tye and Wong (TW) have argued that sphaleron-induced transitions in high-energy proton-proton collisions should be enhanced compared to previous calculations, based on a construction of a Bloch wave function in the…
We construct a new quantum algorithm for the graph collision problem; that is, the problem of deciding whether the set of marked vertices contains a pair of adjacent vertices in a known graph G. The query complexity of our algorithm is…
We study the convergence rates of the semi-discrete (SD) method originally proposed in Halidias (2012), Semi-discrete approximations for stochastic differential equations and applications, International Journal of Computer Mathematics,…
We have calculated integrated cross sections from tabulated nuclear data for two-photon transitions in 178-Hf, summed over all lower states which are possible for a given pair of initial and intermediate states. These processes are of…
In CRYPTO'19, Gohr proposed a new cryptanalysis strategy using machine learning algorithms. Combining the differential-neural distinguisher with a differential path and integrating the advanced key recovery procedure, Gohr achieved a…
FaB Paxos[5] sets a lower bound of 5f + 1 replicas for any two-step consensus protocols tolerating f byzantine failures. Yet, hBFT[3] promises a two-step consensus protocol with only 3f + 1 replicas. As a result, it violates safety property…
Sharding is essential for improving blockchain scalability. Existing protocols overlook diverse adversarial attacks, limiting transaction throughput. This paper presents Reticulum, a groundbreaking sharding protocol addressing this issue,…
In this article we study the interface generated by the collision between two cristals growing layer by layer on a one-dimensional substrate through random decomposition of particles. We relate this interface with the notion of beta-path in…
We present a new, for plasma physics, highly efficient multilevel Monte Carlo numerical method for simulating Coulomb collisions. The method separates and optimally minimizes the finite-timestep and finite-sampling errors inherent in the…
We present a scalable technique for the simulation of collider events with multi-jet final states, based on an improved parton-level event file format. The method is implemented for both leading- and next-to-leading order QCD calculations.…
In this paper we introduce a switching for 2-designs. We illustrate this method by applying it to some symmetric (64,28,12) designs. In that way we obtain six new symmetric (64,28,12) designs. Further, we show that this type of switching…
Petaflop architectures are currently being utilized efficiently to perform large scale computations in Atomic, Molecular and Optical Collisions. We solve the Schroedinger or Dirac equation for the appropriate collision problem using the…
The shellability status of previously investigated simplicial complexes with up to 24 facets is settled. In case of shellability the exact number of shellings is determined. Our algorithm merely relies on the facets, and not on additional…
Scan chains provide increased controllability and observability for testing digital circuits. The increased testability, however, can also be a source of information leakage for sensitive designs. The state-of-the-art defenses to secure…
Message digest algorithms are one of the underlying building blocks of blockchain platforms such as Ethereum. This paper analyses situations in which the message digest collision resistance property can be exploited by attackers. Two…
In this paper a tight bound on the worst-case number of comparisons for Floyd's well known heap construction algorithm, is derived. It is shown that at most 2n-2{\mu}(n)-{\sigma}(n) comparisons are executed in the worst case, where {\mu}(n)…
A new 4-pass Key-Agreement Protocol is presented. The security of the protocol mainly relies on the existence of a (polynomial-computable) One-Way-Function and the supposed computational hardness of solving a specific system of equations.