Results 31 to 40 of about 18,375 (213)
Variationally universal hashing [PDF]
Information Processing Letters, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Krovetz, Ted, Rogaway, Phillip
openaire +2 more sources
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
Hash Property and Fixed-rate Universal Coding Theorems [PDF]
IEEE Transactions on Information Theory, 2008 submitted to IEEE Transactions on Information Theory, Mar. 2008.
Jun Muramatsu, Shigeki Miyake
openalex +4 more sources
Universal Hashing for Information-Theoretic Security [PDF]
Proceedings of the IEEE, 2015 Corrected an error in the proof of Lemma ...
Tyagi, Himanshu, Vardy, Alexander
openaire +3 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 +2 more sources
UMAC: Message Authentication Code using Universal Hashing [PDF]
, 2006 Ted Krovetz +10 more
openalex +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
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 +12 more
core +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 +2 more
core +1 more source
A Case-Based Reasoning Method for Locating Evidence During Digital Forensic Device Triage [PDF]
, 2014 The role of triage in digital forensics is disputed, with some practitioners questioning its reliability for identifying evidential data. Although successfully implemented in the field of medicine, triage has not established itself to the same degree in ...
Horsman, Graeme +2 more
core +1 more source