Results 21 to 30 of about 76,072 (189)
Simple and Space-Efficient Minimal Perfect Hash Functions
Workshop on Algorithms and Data Structures, 2007 A perfect hash function (PHF) h : U → [0,m - 1] for a key set S is a function that maps the keys of S to unique values. The minimum amount of space to represent a PHF for a given set S is known to be approximately 1.44n2/m bits, where n = |S|. In this paper we present new algorithms for construction and evaluation of PHFs of a given set (for m = n and ...
Fabiano C. Botelho, R. Pagh, N. Ziviani
semanticscholar +2 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
Journal of King Saud University: Computer and Information Sciences, 2023 The data breach and the integrity violation of remote data remain significant issues in the domain of information security. A provably-secure hash function aids in providing solutions to integrity-related issues.
P. Karthik +5 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
Comments on perfect hashing functions [PDF]
Communications of the ACM, 1979 Michael R. Anderson, Maija Anderson
openalex +3 more sources
IEEE Access, 2022 Small file processing in Hadoop is one of the challenging task. The performance of the Hadoop is quite good when dealing with large files because they require lesser metadata and consume less memory. But while dealing with enormous amount of small files,
Vijay Shankar Sharma +4 more
doaj +1 more source
A Key Management Protocol Based on the Hash Chain Key Generation for Securing LoRaWAN Networks
Sensors, 2021 Recently, many Low Power Wide Area Network (LPWAN) protocols have been proposed for securing resource-constrained Internet of Things (IoT) devices with negligible power consumption.
Shimaa A. Abdel Hakeem +2 more
doaj +1 more source
Secure Authentication in the Smart Grid
Mathematics, 2022 Authenticated key agreement is a process in which protocol participants communicate over a public channel to share a secret session key, which is then used to encrypt data transferred in subsequent communications.
Mehdi Hosseinzadeh +4 more
doaj +1 more source