Results 81 to 90 of about 1,394 (186)
Uniform Hashing in Constant Time and Optimal Space [PDF]
, 2008 Udgivelsesdato: 2008Many algorithms and data structures employing hashing have been analyzed under the uniform hashing assumption, i.e., the assumption that hash functions behave like truly random functions.
Pagh, Rasmus, Pagh, Anna Östlin
core +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
Universal hashing of rational functions algebraic curves in a cubic field [PDF]
, 2010 Подано визначення універсального гешування по раціональним функцій алгебраїчних кривих Ферма і Гурвіца з великим числом точок в кубічному полі. Отримано вираз для ймовірності колізії та асимптотичні оцінки при великих значеннях розмірності поля ...
Халімов, Геннадій +2 more
core +1 more source
The universality of iterated hashing over variable-length strings [PDF]
, 2012 Iterated hash functions process strings recursively, one character at a time. At each iteration, they compute a new hash value from the preceding hash value and the next character.
Daniel Lemire, Lemire, Daniel
core +1 more source
, 1997 Consider the set H of all linear (or affine) transformations between two vector spaces over a finite field F. We study how good H is as a class of hash functions, namely we consider hashing a set S of sizen into a range having the same cardinality n by a
Petrank, Erez +4 more
core +3 more sources
On Risks of Using a High Performance Hashing Scheme with Common Universal Classes [PDF]
, 2009 The contribution of this thesis is a mathematical analysis a high performance hashing scheme called cuckoo hashing when combined with two very simple and efficient classes of functions that we refer to as the multiplicative class and the linear class ...
Schellbach, Ulf
core
Multiple universal hashing on the maximal curves [PDF]
, 2013 Представлены оценки вероятности коллизии, и сложности вычислений для многократного хеширования по алгебраическим кривым над конечным полем.Представлені оцінки ймовірності колізії, та складності обчислень для багаторазового гешування за алгебричними ...
Г.З. Халимов +2 more
core
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
Quantum hashing via ∈-universal hashing constructions and classical fingerprinting [PDF]
, 2020 © 2015, Pleiades Publishing, Ltd. 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.
Ablayev F., Ablayev M.
core
Once and for All: Universal Transferable Adversarial Perturbation against Deep Hashing-Based Facial Image Retrieval [PDF]
Deep Hashing (DH)-based image retrieval has been widely applied to face-matching systems due to its accuracy and efficiency. However, this convenience comes with an increased risk of privacy leakage.
Tang, Long +4 more
core +1 more source