Results 31 to 40 of about 1,013,929 (223)

Explicit Orthogonal Arrays and Universal Hashing with Arbitrary Parameters [PDF]

Symposium on the Theory of Computing
Orthogonal arrays are a type of combinatorial design that emerged in the 1940s in the design of statistical experiments. In 1947, Rao proved a lower bound on the size of any orthogonal array, and raised the problem of constructing arrays of minimum size.
Nicholas Harvey, Arvin Sahami
semanticscholar   +1 more source

Energy-efficient pipelined bloom filters for network intrusion detection [PDF]

, 2006
This document is made available in accordance with publisher policies. Please cite only the published version using the reference above.
Kaya, I, Kocak, T
core   +3 more sources

Recursive n-gram hashing is pairwise independent, at best [PDF]

, 2010
Many applications use sequences of n consecutive symbols (n-grams). Hashing these n-grams can be a performance bottleneck. For more speed, recursive hash families compute hash values by updating previous values.
Carter, Cohen, Cohen, Cohen, Cohen, Daniel Lemire, Flajolet, Karp, Li, Owen Kaser, Ribler, Schwenk, Weiss   +12 more
core   +2 more sources

Fast hashing with Strong Concentration Bounds

, 2020
Previous work on tabulation hashing by Patrascu and Thorup from STOC'11 on simple tabulation and from SODA'13 on twisted tabulation offered Chernoff-style concentration bounds on hash based sums, e.g., the number of balls/keys hashing to a given bin, but
Aamand Anders, Bernstein Sergei Natanovich, Celis L. Elisa, Dahlgaard Søren, Dumey A. I., Meka Raghu, Mitzenmacher Michael, şcu Mihai P, şcu Mihai P, şcu Mihai P   +9 more
core   +1 more source

COST BENEFIT ANALYSIS OF COMPROMISING LEDGER SYSTEM BASED ON BLOCKCHAIN TECHNOLOGY

BizInfo, 2018
Modern application of the blockchain technology is the center of attention of technology and economy sectors. Proper usage of blockchain is based on peer to peer (P2P) network to coordinate a worldwide, universal ledger where all transactions on the ...
Edis Mekić, Safet Purković, Ahmedin Lekpek   +2 more
doaj   +1 more source

Universal classes of hash functions

Journal of Computer and System Sciences, 1979
AbstractThis paper gives an input independent average linear time algorithm for storage and retrieval on keys. The algorithm makes a random choice of hash function from a suitable class of hash functions. Given any sequence of inputs the expected time (averaging over all functions in the class) to store and retrieve elements is linear in the length of ...
Larry Carter, Mark N. Wegman
openaire   +2 more sources

Topological Quantum Gate Construction by Iterative Pseudogroup Hashing

, 2010
We describe the hashing technique to obtain a fast approximation of a target quantum gate in the unitary group SU(2) represented by a product of the elements of a universal basis.
Burrello, Michele, Mussardo, Giuseppe, Wan, Xin   +2 more
core   +1 more source

Enhancing Extractable Quantum Entropy in Vacuum-Based Quantum Random Number Generator

Entropy, 2018
Information-theoretically provable unique true random numbers, which cannot be correlated or controlled by an attacker, can be generated based on quantum measurement of vacuum state and universal-hashing randomness extraction.
Xiaomin Guo, Ripeng Liu, Pu Li, Chen Cheng, Mingchuan Wu, Yanqiang Guo   +5 more
doaj   +1 more source

Leftover Hashing Against Quantum Side Information

, 2010
The Leftover Hash Lemma states that the output of a two-universal hash function applied to an input with sufficiently high entropy is almost uniformly random.
Renner, Renato, Schaffner, Christian, Smith, Adam, Tomamichel, Marco   +3 more
core   +1 more source

Electronic records long term authenticity and integrity demonstration

Knjižnica, 2011
Long term preservation of electronic data requires introduction of specific technology solutions and organizational measures in order to provide stable environment for electronic record preservation.
Helena Halas, Aljoša Jerman Blažič
doaj   +1 more source