Results 251 to 260 of about 26,379 (302)
Post-Quantum Revocable Linkable Ring Signature Scheme Based on SPHINCS+ for V2G Scenarios. [PDF]
Sensors (Basel)Liu S, Du YN, Wang XA, Hu X, Su HE.
europepmc +1 more source
Tierra: multi-tiered arrays and recency-aware hot data decision. [PDF]
Sci RepLee H, Park D.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Journal of the ACM, 1999
Consider the set ℋ of all linear (or affine) transformations between two vector spaces over a finite field F . We study how good ℋ is as a class of hash functions, namely we consider hashing a set S of size n into a range having the same cardinality n
Noga Alon +4 more
openaire +2 more sources
Consider the set ℋ of all linear (or affine) transformations between two vector spaces over a finite field F . We study how good ℋ is as a class of hash functions, namely we consider hashing a set S of size n into a range having the same cardinality n
Noga Alon +4 more
openaire +2 more sources
Cryptologia, 2019
GOST-R 34.11-94 is a Russian standard cryptographic hash function that was introduced in 1994 by the Russian Federal Agency for the purposes of information processing, information security, and dig...
Khushboo Bussi +3 more
openaire +1 more source
GOST-R 34.11-94 is a Russian standard cryptographic hash function that was introduced in 1994 by the Russian Federal Agency for the purposes of information processing, information security, and dig...
Khushboo Bussi +3 more
openaire +1 more source
Learning to hash: forgiving hash functions and applications
Data Mining and Knowledge Discovery, 2008The problem of efficiently finding similar items in a large corpus of high-dimensional data points arises in many real-world tasks, such as music, image, and video retrieval. Beyond the scaling difficulties that arise with lookups in large data sets, the complexity in these domains is exacerbated by an imprecise definition of similarity. In this paper,
Shumeet Baluja, Michele Covell
openaire +1 more source
Collections of Functions for Perfect Hashing
SIAM Journal on Computing, 1986Summary: Hashing techniques for accessing a table without searching it are usually designed to perform efficiently on the average over all possible contents of the table. If the table contents are known in advance, we might be able to choose a hashing function with guaranteed efficient (worst-case) performance.
Francine Berman +4 more
openaire +2 more sources
European Transactions on Telecommunications, 1994
AbstractHash functions were introduced in cryptology in the late seventies as a tool to protect the authenticity of information. Soon it became clear that they were a very useful building block to solve other security problems in telecommunication and computer networks.
openaire +1 more source
AbstractHash functions were introduced in cryptology in the late seventies as a tool to protect the authenticity of information. Soon it became clear that they were a very useful building block to solve other security problems in telecommunication and computer networks.
openaire +1 more source
1996
We give a new definition of keyed hash functions and show its relation with strongly universal hash functions and Cartesian authentication codes. We propose an algorithm for a secure keyed hash function and present preliminary result on its performance. The algorithm can be used for fast (about twice the speed of MD5) and secure message authentication.
Shahram Bakhtiari +2 more
openaire +1 more source
We give a new definition of keyed hash functions and show its relation with strongly universal hash functions and Cartesian authentication codes. We propose an algorithm for a secure keyed hash function and present preliminary result on its performance. The algorithm can be used for fast (about twice the speed of MD5) and secure message authentication.
Shahram Bakhtiari +2 more
openaire +1 more source
IEEE Transactions on Computers, 2005
Bank conflicts can severely reduce the bandwidth of an interleaved multibank memory and conflict misses increase the miss rate of a cache or a predictor. Both occurrences are manifestations of the same problem: objects, which should be mapped to different indices, are accidentally mapped to the same index.
Hans Vandierendonck +1 more
openaire +1 more source
Bank conflicts can severely reduce the bandwidth of an interleaved multibank memory and conflict misses increase the miss rate of a cache or a predictor. Both occurrences are manifestations of the same problem: objects, which should be mapped to different indices, are accidentally mapped to the same index.
Hans Vandierendonck +1 more
openaire +1 more source
Universal hash functions for an infinite universe and hash trees
Information Processing Letters, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source