Related papers: 22-Step Collisions for SHA-2
We develop a rigorous quantum mechanical theory for collisions of polyatomic molecular radicals with S-state atoms in the presence of an external magnetic field. The theory is based on a fully uncoupled space-fixed basis set representation…
cryptographic hash function is a deterministic procedure that compresses an arbitrary block of numerical data and returns a fixed-size bit string. There exist many hash functions: MD5, HAVAL, SHA, ... It was reported that these hash…
In Xe+Sn central collisions from 12 to 20 MeV/A measured with the INDRA 4$\pi$ multidetector, the three-fragment exit channel occurs with a significant cross section. In this contribution, we show that these fragments arise from two…
Recent cryptanalytic attacks have exposed the vulnerabilities of some widely used cryptographic hash functions like MD5 and SHA-1. Attacks in the line of differential attacks have been used to expose the weaknesses of several other hash…
Two-step hybrid methods specially adapted to the numerical integration of perturbed oscillators are obtained. The formulation of the methods is based on a refinement of classical Taylor expansions due to Scheifele [{\em Z. Angew. Math.…
With the continuous improvement of attack methods, there are more and more distributed, complex, targeted attacks in which the attackers use combined attack methods to achieve the purpose. Advanced cyber attacks include multiple stages to…
Sharding, i.e. splitting the miners or validators to form and run several subchains in parallel, is known as one of the main solutions to the scalability problem of blockchains. The drawback is that as the number of miners expanding each…
We present a fully dynamical simulation of central nuclear collisions around mid-rapidity at LHC energies. Unlike previous treatments, we simulate all phases of the collision, including the equilibration of the system. For the simulation,…
Hashing images with a perceptual algorithm is a common approach to solving duplicate image detection problems. However, perceptual image hashing algorithms are differentiable, and are thus vulnerable to gradient-based adversarial attacks.…
Hashing functions, which are created to provide brief and erratic digests for the message entered, are the primary cryptographic primitives used in blockchain networks. Hashing is employed in blockchain networks to create linked block…
We study the following variant of the 15 puzzle. Given a graph and two token placements on the vertices, we want to find a walk of the minimum length (if any exists) such that the sequence of token swappings along the walk obtains one of…
For calculation of cross sections for collisional transitions between rotational levels in a molecule, a computer code, MOLSCAT has been developed by Hutson \& Green (1994). For the transitions between rotational levels in H$_2$CS due to…
This paper focuses on devising methods for producing collisions in algebraic hash functions that may be seen as generalized forms of the well-known Z\'emor and Tillich-Z\'emor hash functions. In contrast to some of the previous approaches,…
We present quantum dynamics of collisions between two para-H2 molecules from low (1 mK) to high collision energies (1 eV). The calculations are carried out using a quantum scattering code that solves the time-independent Schrodinger…
Throughput limitations of existing blockchain architectures are one of the most significant hurdles for their wide-spread adoption. Attempts to address this challenge include layer-2 solutions, such as Bitcoin's Lightning or Ethereum's…
The Strict Avalanche Criterion (SAC) is a measure of both confusion and diffusion, which are key properties of a cryptographic hash function. This work provides a working definition of the SAC, describes an experimental methodology that can…
We have calculated elastic and state-resolved inelastic cross sections for cold and ultracold collisions in the Rb($^1 S$) + OH($^2 \Pi_{3/2}$) system, including fine-structure and hyperfine effects. We have developed a new set of five…
Hash functions like SHA-1 or MD5 are one of the most important cryptographic primitives, especially in the field of information integrity. Considering the fact that increasing methods have been proposed to break these hash algorithms, a…
Side channel attacks (SCAs) remain a significant threat to the security of cryptographic systems in modern embedded devices. Even mathematically secure cryptographic algorithms, when implemented in hardware, inadvertently leak information…
We introduce the Single Stage Headless (SSH) face detector. Unlike two stage proposal-classification detectors, SSH detects faces in a single stage directly from the early convolutional layers in a classification network. SSH is headless.…