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

The development of accurate and fast numerical schemes for the five fold Boltzmann collision integral represents a challenging problem in scientific computing. For a particular class of interactions, including the so-called hard spheres…

Some parallel constructions of a SHAKE hash function using Sakura coding are introduced, whose basic operation is the Keccak's permutation. For each proposed tree-based algorithm, observations are made on both its parallel running time…

Due to the increasing use of encrypted communication, such as Transport Layer Security (TLS), encrypted cache systems are a promising approach for providing communication efficiency and privacy. Cache-22 is an encrypted cache system (Emura…

In this work we introduce a new family of twelve-step linear multistep methods for the integration of the Schr\"odinger equation. The new methods are constructed by adopting a new methodology which improves the phase lag characteristics by…

One of the key sources of transverse impedance in the LHC has been the secondary graphite collimators that sit close to the beam at all energies. This limits the stable bunch intensity due to transverse coupled-bunch instabilities and…

I present generalized formulas for approximate corrections to QCD hard-scattering cross sections through second order in the perturbative expansion. The approximate results are based on recent two-loop calculations for soft and collinear…

While many hardware accelerators have recently been proposed to address the inefficiency problem of fully homomorphic encryption (FHE) schemes, none of them is able to deliver optimal performance when facing real-world FHE workloads…

We develop a formalism for calculating probabilities for the outcomes of stellar dynamical interactions, based on results from $N$-body scattering experiments. We focus here on encounters involving up to six particles and calculate…

Contraction Hierarchies (CH) (Geisberger et al., 2008) is one of the most widely used algorithms for shortest-path queries on road networks. Compared to Dijkstra's algorithm, CH enables orders of magnitude faster query performance through a…

We describe the methods used by Team Shadoks to win the CG:SHOP 2026 Challenge on parallel reconfiguration of planar triangulations. An instance is a collection of triangulations of a common point set. We must select a center triangulation…

We present new algorithms to perform fast probabilistic collision queries between convex as well as non-convex objects. Our approach is applicable to general shapes, where one or more objects are represented using Gaussian probability…

This paper introduces the first two-dimensional XOR-based secret sharing scheme for layered multipath communication networks. We present a construction that guarantees successful message recovery and perfect privacy when an adversary…

I discuss methods for identifying and quantifying phase transitions in particle collisions, concentrating on two techniques for use in ultra-relativistic nuclear collisions. The first technique is to use rapidity correlation measurements to…

This work introduces the nested-set Hessian approximation, a second-order approximation method that can be used in any derivative-free optimization routine that requires such information. It is built on the foundation of the generalized…

The article is devoted to the construction of explicit one-step strong numerical methods with the orders 2.0 and 2.5 of convergence for Ito stochastic differential equations with multidimensional non-commutative noise. We consider the…

Spray formation and atomization in a gas-liquid mixing layer is an important fundamental problem of multiphase flows. It is highly desirable to visualize the detailed atomization process and to analyze the instabilities and mechanisms…

Traditional Blockchain Sharding approaches can only tolerate up to n/3 of nodes being adversary because they rely on the hypergeometric distribution to make a failure (an adversary does not have n/3 of nodes globally but can manipulate the…

Ohya and Volovich have been proposed a new quantum computation model with chaos amplification to solve the SAT problem, which went beyond usual quantum algorithm. In this paper we study the complexity of the SAT algorithm by counting the…

Many computerized methods for RNA-RNA interaction structure prediction have been developed. Recently, $O(N^6)$ time and $O(N^4)$ space dynamic programming algorithms have become available that compute the partition function of RNA-RNA…

A method is developed to calculate collision probability in this paper. Based on the encounter geometric features of space objects, it is reasonable to separate the radial orbital motions from that in the cross section for most encounter…