Designing small universal k-mer hitting sets for improved analysis of high-throughput sequencing. [PDF]
PLoS Computational Biology, 2017 With the rapidly increasing volume of deep sequencing data, more efficient algorithms and data structures are needed. Minimizers are a central recent paradigm that has improved various sequence analysis tasks, including hashing for faster read overlap ...
Yaron Orenstein +4 more
doaj +1 more source
ForestDSH: a universal hash design for discrete probability distributions [PDF]
Data Mining and Knowledge Discovery, 2021 45 pages,11 ...
Arash Gholami Davoodi +5 more
openaire +3 more sources
UMAC: Message Authentication Code using Universal Hashing [PDF]
Request for Comments, 2006 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
Lightweight MACs from Universal Hash Functions [PDF]
, 2020 Lightweight cryptography is a topic of growing importance, with the goal to secure the communication of low-end devices that are not powerful enough to use conventional cryptography. There have been many recent proposals of lightweight block ciphers, but comparatively few results on lightweight Message Authentication Codes (MACs). Therefore, this paper
Duval, Sébastien, Leurent, Gaëtan
openaire +3 more sources
On Risks of Using Cuckoo Hashing with Simple Universal Hash Classes [PDF]
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009 Cuckoo hashing, introduced by Pagh and Rodler [10], is a dynamic dictionary data structure for storing a set S of n keys from a universe U, with constant lookup time and amortized expected constant insertion time. For the analysis, space (2+e)n and Ω(log n)-wise independence of the hash functions is sufficient. In experiments mentioned in [10], several
Martin Dietzfelbinger, Ulf Schellbach
openaire +1 more source
On perfect hashing of numbers with sparse digit representation via multiplication by a constant [PDF]
, 2011 Consider the set of vectors over a field having non-zero coefficients only in a fixed sparse set and multiplication defined by convolution, or the set of integers having non-zero digits (in some base $b$) in a fixed sparse set.
Monge, Maurizio
core +2 more sources
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ć +2 more
doaj +1 more source
Fast and Powerful Hashing using Tabulation [PDF]
, 2016 Randomized algorithms are often enjoyed for their simplicity, but the hash functions employed to yield the desired probabilistic guarantees are often too complicated to be practical.
Thorup, Mikkel
core +3 more sources
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 +2 more sources
Commitment and Oblivious Transfer in the Bounded Storage Model with Errors [PDF]
, 2017 The bounded storage model restricts the memory of an adversary in a cryptographic protocol, rather than restricting its computational power, making information theoretically secure protocols feasible.
Dowsley, Rafael +2 more
core +2 more sources