Results 51 to 60 of about 966 (158)
The computational complexity of universal hashing
Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90, 1990 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mansour, Yishay +2 more
openaire +1 more source
Software Performance of Universal Hash Functions [PDF]
, 1999 This paper compares the parameters sizes and software performance of several recent constructions for universal hash functions: bucket hashing, polynomial hashing, Toeplitz hashing, division hashing, evaluation hashing, and MMH hashing. An objective comparison between these widely varying approaches is achieved by defining constructions that offer a ...
Nevelsteen, W., Preneel, Bart
openaire +2 more sources
BioFactors, Volume 52, Issue 1, January/February 2026.This study shows that oral administration of Crocus sativus tepals extract (CTE) restores gut microbiota composition and promotes SCFA‐producing and anti‐inflammatory bacterial genera. It improves intestinal barrier integrity and reduces inflammation in the jejunum and liver, suggesting a possible link between the gut microbiota and the metabolic ...
Biljana Bursać +9 more
wiley +1 more source
Combinatorial techniques for universal hashing
Journal of Computer and System Sciences, 1994 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Corporate Social Responsibility and Environmental Management, Volume 33, Issue 1, Page 217-235, January 2026.ABSTRACT Despite the universal acknowledgment of financial profit expectations as an investment driver, environmental concern has been suggested as a factor influencing investors' decisions to purchase cryptocurrency. In this sense, this study investigates the impact of environmental information on investment allocation decisions to purchase different ...
Moritz Wendl +2 more
wiley +1 more source
Construction of universal one-way hash functions: Tree hashing revisited
Discrete Applied Mathematics, 2007 AbstractWe present a binary tree based parallel algorithm for extending the domain of a universal one-way hash function (UOWHF). For t⩾2, our algorithm extends the domain from the set of all n-bit strings to the set of all ((2t-1)(n-m)+m)-bit strings, where m is the length of the message digest. The associated increase in key length is 2m bits for t=2;
openaire +1 more source
Quantum Hashing via Classical $\epsilon$-universal Hashing Constructions
, 2014 In the paper, we define the concept of the quantum hash generator and offer design, which allows to build a large amount of different quantum hash functions. The construction is based on composition of classical $\epsilon$-universal hash family and a given family of functions -- quantum hash generator.
Ablayev, Farid, Ablayev, Marat
openaire +1 more source
Separating hash families with large universe
Journal of Combinatorial Theory, Series ASeparating hash families are useful combinatorial structures which generalize several well-studied objects in cryptography and coding theory. Let $p_t(N, q)$ denote the maximum size of universe for a $t$-perfect hash family of length $N$ over an alphabet of size $q$. In this paper, we show that $q^{2-o(1)}
Xin Wei, Xiande Zhang, Gennian Ge
openaire +3 more sources
A2—codes from universal hash classes [PDF]
, 1995 We describe a general method to construct codes for unconditional authentication with arbitration (A2-codes), which protect not only against outside opponents but also against certain types of frauds from the receiver and transmitter. The constructions are based on orthogonal arrays and universal hash classes.
openaire +1 more source
Universal Hash Functions & Hard Core Bits [PDF]
, 1995 In this paper we consider the bit-security of two types of universal hash functions: linear functions on GF[2n] and linear functions on the integers modulo a prime. We show individual security for all bits in the first case and for the O(log n) least significant bits in the second case.
openaire +1 more source