相关论文: SHA-1 and the Strict Avalanche Criterion

Avalanches, or Avalanche-like, events are often observed in the dynamical behaviour of many complex systems which span from solar flaring to the Earth's crust dynamics and from traffic flows to financial markets. Self-organized criticality…

Current and future surveys of large-scale cosmic structure are associated with a massive and complex datastream to study, characterize, and ultimately understand the physics behind the two major components of the 'Dark Universe', dark…

One of the most well-known classical results for site percolation on the square lattice is the equation $p_c+p_c^*=1$. In words, this equation means that for all values $\neq p_c$ of the parameter $p$, the following holds: either a.s. there…

Cybersecurity is a relentless arms race, with AI driven offensive systems evolving faster than traditional defenses can adapt. Research and tooling remain fragmented across isolated defensive functions, creating blind spots that adversaries…

Convex splitting is a powerful technique in quantum information theory used in proving the achievability of numerous information-processing protocols such as quantum state redistribution and quantum network channel coding. In this work, we…

The nowadays massive amounts of generated and communicated data present major challenges in their processing. While capable of successfully classifying nonlinearly separable objects in various settings, subspace clustering (SC) methods…

Real-world applications routinely make authorization decisions based on dynamic computation. Reasoning about dynamically computed authority is challenging. Integrity of the system might be compromised if attackers can improperly influence…

A new framework for information hiding security, called chaos-security, has been proposed in a previous study. It is based on the evaluation of unpredictability of the scheme, whereas existing notions of security, as stego-security, are…

Subspace clustering (SC) is a promising clustering technology to identify clusters based on their associations with subspaces in high dimensional spaces. SC can be classified into hard subspace clustering (HSC) and soft subspace clustering…

Consistent hashing is a technique that can minimize key remapping when the number of hash buckets changes. The paper proposes a fast consistent hash algorithm (called power consistent hash) that has $O(1)$ expected time for key lookup,…

Modern authentication systems store hashed values of passwords of users using cryptographic hash functions. Therefore, to crack a password an attacker needs to guess a hash function input that is mapped to the hashed value, as opposed to…

The Red-Sequence Cluster Survey (RCS) is a 100 deg^2 galaxy cluster survey designed to provide a large sample of optically selected clusters of galaxies with redshifts 0.1<z<1.4. The survey data are also useful for a variety of lensing…

The sponge is a cryptographic construction that turns a public permutation into a hash function. When instantiated with the Keccak permutation, the sponge forms the NIST SHA-3 standard. SHA-3 is a core component of most post-quantum…

The modern data compression is mainly based on two approaches to entropy coding: Huffman (HC) and arithmetic/range coding (AC). The former is much faster, but approximates probabilities with powers of 2, usually leading to relatively low…

We establish a Sanov type large deviation principle for an ensemble of interacting Brownian rough paths. As application a large deviations for the ($k$-layer, enhanced) empirical measure of weakly interacting diffusions is obtained. This in…

Spanning Centrality is a measure used in network analysis to determine the importance of an edge in a graph based on its contribution to the connectivity of the entire network. Specifically, it quantifies how critical an edge is in terms of…

The Excursion Set approach has been used to make predictions for a number of interesting quantities in studies of nonlinear hierarchical clustering. These include the halo mass function, halo merger rates, halo formation times and masses,…

The problem of model counting, also known as #SAT, is to compute the number of models or satisfying assignments of a given Boolean formula $F$. Model counting is a fundamental problem in computer science with a wide range of applications.…

Oja's algorithm of principal component analysis (PCA) has been one of the methods utilized in practice to reduce dimension. In this paper, we focus on the convergence property of the discrete algorithm. To realize that, we view the…

This paper reveals a novel numerical method, the sequential test, which approves chaos through sequences of numbers observations. The method alights alongside the Lyapunov exponent and bifurcation diagram test. Explicitly elucidation of the…