Results 1 to 10 of about 521,887 (151)
High Performance Construction of RecSplit Based Minimal Perfect Hash Functions [PDF]
arXiv, 2022 A minimal perfect hash function (MPHF) bijectively maps a set S of objects to the first |S| integers. It can be used as a building block in databases and data compression. RecSplit [Esposito et al., ALENEX'20] is currently the most space efficient practical minimal perfect hash function.
Dominik Bez +3 more
arxiv +3 more sources
Balanced Families of Perfect Hash Functions and Their Applications [PDF]
Proc. of 34th ICALP (2007), 435-446, 2008 The construction of perfect hash functions is a well-studied topic. In this paper, this concept is generalized with the following definition. We say that a family of functions from $[n]$ to $[k]$ is a $\delta$-balanced $(n,k)$-family of perfect hash functions if for every $S \subseteq [n]$, $|S|=k$, the number of functions that are 1-1 on $S$ is ...
Noga Alon, Shai Gutner
arxiv +3 more sources
Partially perfect hash functions for intersecting families [PDF]
arXiv, 2018 Consider a large network with unknown number of nodes. Some of these nodes coordinate to perform tasks. The number of such coordination groups is also unknown. The only information about the network available is that any two coordinating groups share at least $t$ nodes.
Tapas Kumar Mishra
arxiv +3 more sources
Fast Scalable Construction of (Minimal Perfect Hash) Functions [PDF]
arXiv, 2016 Recent advances in random linear systems on finite fields have paved the way for the construction of constant-time data structures representing static functions and minimal perfect hash functions using less space with respect to existing techniques.
Marco Genuzio +2 more
arxiv +3 more sources
A new lattice-based password authenticated key exchange scheme with anonymity and reusable key [PDF]
PeerJ Computer ScienceIn this article, we propose a novel bilateral generalization inhomogenous short integer solution (BiGISIS)-based password-authenticated key exchange (PAKE) scheme for post-quantum era security.
Kübra Seyhan, Sedat Akleylek
doaj +3 more sources
Comprehensive Performance Study of Hashing Functions [PDF]
Computer Science Journal of Moldova, 2023 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
XOR Chain and Perfect Secrecy at the Dawn of the Quantum Era
Cryptography, 2023 In this article, we present a new method that achieves Shannon’s perfect secrecy. To achieve this property, we will introduce the triple XOR cancellation rule. The approach has two execution modes: digital signature and data encryption.
Luis Adrián Lizama-Pérez
doaj +1 more source
General encoding of canonical k-mers
Peer Community Journal, 2023 To index or compare sequences efficiently, often k-mers, i.e., substrings of fixed length k, are used. For efficient indexing or storage, k-mers are often encoded as integers, e.g., applying some bijective mapping between all possible σk k-mers and the ...
Wittler, Roland
doaj +1 more source
Efficient Cancelable Template Generation Based on Signcryption and Bio Hash Function
Axioms, 2022 Cancelable biometrics is a demanding area of research in which a cancelable template conforming to a biometric is produced without degrading the efficiency.
Vani Rajasekar +5 more
doaj +1 more source