相关论文: 22-Step Collisions for SHA-2

The problem of finding aperiodic low auto-correlation binary sequences (LABS) presents a significant computational challenge, particularly as the sequence length increases. Such sequences have important applications in communication…

Perceptual hashing algorithms (PHAs) are widely used for identifying illegal online content and are thus integral to various sensitive applications. However, due to their hasty deployment in real-world scenarios, their adversarial security…

This report summarises important technical challenges and their solutions in the calculation of the next-to-next-to-leading order QCD corrections to the width difference $\Delta\Gamma_s$ in the $B_s-\overline{B}_s$ system. We focus on the…

Side-channel attacks are a major threat to the security of cryptographic implementations, particularly for small devices that are under the physical control of the adversary. While several strategies for protecting against side-channel…

Sharding has shown great potential to scale out blockchains. It divides nodes into smaller groups which allow for partial transaction processing, relaying and storage. Hence, instead of running one blockchain, we will run multiple…

This program can be used to simulate polarised nucleon - nucleon collisions at high energies. Spins of colliding particles are taken into account. The program allows to calculate cross sections for various processes.

Partitioning graphs into blocks of roughly equal size such that few edges run between blocks is a frequently needed operation in processing graphs. Recently, size, variety, and structural complexity of these networks has grown dramatically.…

In this paper, we present a study that proposes a three-stage classifier model which employs a machine learning algorithm to develop an intrusion detection and identification system for tens of different types of attacks against industrial…

Stepping-stone intrusions (SSIs) are a prevalent network evasion technique in which attackers route sessions through chains of compromised intermediate hosts to obscure their origin. Effective SSI detection requires correlating the incoming…

In this article we develop a numerical scheme to deal with interfaces between touching numerical grids when solving the second-order wave equation. We show that it is possible to implement an interface scheme of "penalty" type for the…

The High-Luminosity LHC is expected to deliver proton-proton collisions every 25 ns with an estimated 140-200 pileup interactions per bunch crossing. Ultrafast track finding is vital for handling Level 1 trigger rates in such conditions. An…

The determination of charged particle trajectories (tracking) in collisions at the CERN Large Hadron Collider (LHC) is one of the most important aspects for event reconstruction at hadron colliders. This is especially true in the high…

This note provides very simple, efficient algorithms for computing the number of distinct longest common subsequences of two input strings and for computing the number of LCS embeddings.

Sharding has emerged as a critical solution to address the scalability challenges faced by blockchain networks, enabling them to achieve higher transaction throughput, reduced latency, and optimized resource usage. This paper investigates…

We describe a new implementation of a parallel Tree-SPH code with the aim to simulate Galaxy Formation and Evolution. The code has been parallelized using SHMEM, a Cray proprietary library to handle communications between the 256 processors…

Multiplicity distributions and their scaling behaviour for various types of secondary charged particles produced in 28Si-nucleus collisions at 4.5A and 14.5A GeV are investigated. The validity of KNO scaling and its generalized form has…

We describe an efficient Particle-Mesh algorithm for the Connection Machine CM-5. Our particular method parallelizes well and the computation time per time step decreases as the particles become more clustered. We achieve floating-point…

The cross--section for two--photon events with (at least) two independent partonic scatters is estimated, for LEP energies as well as a 500 GeV ``photon collider". This results in events with (at least) four central (mini--)jets. Such…

We construct rigorously suitable approximate solutions to the Stokes/Cahn-Hilliard system by using the method of matched asymptotics expansions. This is a main step in the proof of convergence given in the first part of this contribution,…

We show how to answer spatial multiple-set intersection queries in O(n(log w)/w + kt) expected time, where n is the total size of the t sets involved in the query, w is the number of bits in a memory word, k is the output size, and c is any…