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

While increasingly more application-specific blockchains, or ledgers, are being implemented and deployed, exchanging information between these ledgers remains an open problem. Existing cross-ledger protocols (XLPs) exhibit a variety of…

Hash functions are a basic cryptographic primitive. Certain hash functions try to prove security against collision and preimage attacks by reductions to known hard problems. These hash functions usually have some additional properties that…

We explore the evolution of collisionally merged stars in the blue straggler region of the HR diagram. The starting models for our stellar evolution calculations are the results of the smoothed particle hydrodynamics (SPH) simulations of…

Blockchain like Bitcoin and Ethereum suffer from scalability issues. Sharding is one of the most promising and leading solutions to scale blockchain. The basic idea behind sharding is to divide the blockchain network into multiple…

Fault-tolerant complexes describe surface-code fault-tolerant protocols from a single geometric object. We first introduce fusion complexes that define a general family of fusion-based quantum computing (FBQC) fault-tolerant quantum…

A new system of hexadecimal and base-256 numerals is proposed whose digit shapes are based on binary numerals. The proposed numerals are implemented in open source fonts and integrated into popular editors (Notepad++ and Eclipse) to prove…

A Monte Carlo simulator is presented to reproduce data of nucleus-nucleus interactions at high energies. The program is designed in a microscopic point of view, where the cascade approach is applied. Moreover, each nucleon from both the…

A Monte Carlo model to simulate nuclear collisions in the energy range going from SPS to LHC, is presented. The model includes in its initial stage both soft and semihard components, which lead to the formation of color strings.…

The inelasticity in nucleus-nucleus collisions at high energies is calculated in the framework of geometrical multichain model. The very fast increase of the inelasticity is found as a result of a second-stage cascading process. The same…

In this paper, we introduce a reconciliation protocol with a two-step error correction scheme that uses a short-blocklength, low-rate code and a long-blocklength, high-rate code. We simulate the protocol using a short-block-length…

Existing blockchain systems scale poorly because of their distributed consensus protocols. Current attempts at improving blockchain scalability are limited to cryptocurrency. Scaling blockchain systems under general workloads (i.e.,…

The analysis of extensive numerical data for the percolation probabilities of incipient spanning clusters in two dimensional percolation at criticality are presented. We developed an effective code for the single-scan version of the…

Quantum hashing is a widely used technique in quantum computation that allows us to design space-efficient algorithms and protocols. Recently, Vasiliev has shown that the phase form of shallow quantum hashing can be implemented by a circuit…

This paper proposes a method for identification of a user`s fixed string set (which can be a command/instruction set for a terminal or microprocessor). This method is fast and has very small memory requirements, compared to a traditional…

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…

We study the round and communication complexities of various cryptographic protocols. We give tight lower bounds on the round and communication complexities of any fully black-box reduction of a statistically hiding commitment scheme from…

We report on a very large set of simulations of collisions between two main sequence (MS) stars. These computations were done with the ``Smoothed Particle Hydrodynamics'' method. Realistic stellar structure models for evolved MS stars were…

The new multipurpose event-generation framework SHERPA, acronym for Simulation for High-Energy Reactions of PArticles, is presented. It is entirely written in the object-oriented programming language C++. In its current form, it is able to…

Two algorithms for construction of all closed knight's paths of lengths up to 16 are presented. An approach for classification (up to equivalence) of all such paths is considered. By applying the construction algorithms and classification…

Semantic caching has emerged as a pivotal technique for scaling LLM applications, widely adopted by major providers including AWS and Microsoft. By utilizing semantic embedding vectors as cache keys, this mechanism effectively minimizes…