Results 21 to 30 of about 1,098,148 (248)
UMAC: Message Authentication Code using Universal Hashing [PDF]
This specification describes how to generate an authentication tag using the UMAC message authentication algorithm. UMAC is designed to be very fast to compute in software on contemporary uniprocessors.
Ted Krovetz
openalex +2 more sources
Iterative Universal Hash Function Generator for Minhashing [PDF]
Minhashing is a technique used to estimate the Jaccard Index between two sets by exploiting the probability of collision in a random permutation. In order to speed up the computation, a random permutation can be approximated by using an universal hash function such as the $h_{a,b}$ function proposed by Carter and Wegman.
openaire +3 more sources
Genetically Engineered Brain Organoids Recapitulate Spatial and Developmental States of Glioblastoma Progression. [PDF]
This study develops engineered glioblastoma organoids to investigate the role of specific mutations in tumor progression. The analytic framework spans single‐cell analysis, spatial transcriptomics, single‐cell trajectory analysis, orthotopic implantation, clinically oriented imaging, and histopathological analysis.
Ishahak M+10 more
europepmc +2 more sources
Construction of universal one-way hash functions: Tree hashing revisited
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;
Palash Sarkar
openalex +3 more sources
Comprehensive Performance Study of Hashing Functions [PDF]
Most literature on hashing functions speaks in terms of hashing functions being either ‘good’ or ‘bad’. In this paper, we demonstrate how a hashing function that gives good results for one key set, performs badly for another.
G. M. Sridevi+2 more
doaj +1 more source
One-Time Universal Hashing Quantum Digital Signatures without Perfect Keys [PDF]
Quantum digital signatures (QDS), generating correlated bit strings among three remote parties for signatures through quantum law, can guarantee non-repudiation, authenticity, and integrity of messages. Recently, one-time universal hashing QDS framework,
Bing-Hong Li+6 more
semanticscholar +1 more source
Hash Property and Fixed-rate Universal Coding Theorems [PDF]
The aim of this paper is to prove the achievability of fixed-rate universal coding problems by using our previously introduced notion of hash property. These problems are the fixed-rate lossless universal source coding problem and the fixed-rate universal channel coding problem.
Jun Muramatsu, Shigeki Miyake
openalex +3 more sources
Universal classes of hash functions
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 ...
J.Lawrence Carter, Mark N. Wegman
openalex +3 more sources
EliMAC: Speeding Up LightMAC by around 20%
Universal hash functions play a prominent role in the design of message authentication codes and the like. Whereas it is known how to build highly efficient sequential universal hash functions, parallel non-algebraic universal hash function designs are ...
Christoph Dobraunig+2 more
doaj +1 more source
Abstract Blockchain is increasingly lauded as an enabler of the transition to a circular economy. While there is considerable conceptual research and some empirical studies on this phenomenon, scholars have yet to develop a theoretical model of blockchain's role in this transition.
Moritz Böhmecke‐Schwafert+2 more
wiley +1 more source