Results 181 to 190 of about 643,283 (231)
Some of the next articles are maybe not open access.
Fingerprinting-based Minimal Perfect Hashing Revisited
ACM Journal of Experimental Algorithmics, 2023In this paper we study a fingerprint-based minimal perfect hash function (FMPH for short). While FMPH is not as space-efficient as some other minimal perfect hash functions (for example RecSplit, CHD, or PTHash), it has a number of practical advantages ...
Piotr Beling
semanticscholar +1 more source
Perfect hashing functions for hardware applications
[1991] Proceedings. Seventh International Conference on Data Engineering, 2002Perfect hashing functions are determined that are suitable for hardware implementations. A trial-and-error method of finding perfect hashing functions is proposed using a simple universal/sub 2/ class (H/sub 3/) of hashing functions. The results show that the relative frequency of perfect hashing functions within the class H/sub 3/ is the same as ...
G.A. Portice, M.V. Ramakrishna
openaire +2 more sources
The Quantum Resistant Cryptographic Algorithm Based on OTP Cipher and Hash Function
2024 IEEE International Conference on Consumer Electronics-Asia (ICCE-Asia)The article proposes a new quantum-resistant cryptographic algorithm constructed based on the OTP (One-Time Pad) cipher and a hash function. By inheriting the property of “perfect secrecy” from the OTP cipher, the proposed algorithm can resist various ...
L. H. Dung +3 more
semanticscholar +1 more source
International Conference on Ubiquitous Information Management and Communication, 2016
Remote user authentication schemes are commonly used for communication between authorized users and remote servers over an insecure network. Due to its simplicity and convenience this method is widely used in many environments, such as sensor networks or
Jaewook Jung +5 more
semanticscholar +1 more source
Remote user authentication schemes are commonly used for communication between authorized users and remote servers over an insecure network. Due to its simplicity and convenience this method is widely used in many environments, such as sensor networks or
Jaewook Jung +5 more
semanticscholar +1 more source
An Interactive System for Finding Perfect Hash Functions
IEEE Software, 1985The interactive implementation of this hash function algorithm presents several examples of large lexicon design, illustrating how the minimality criterion and execution efficiency can vary when various problem parameters are adjusted.
John Boates, Max Krause, Nick Cercone
openaire +2 more sources
On the design of letter oriented minimal perfect hashing functions [PDF]
Journal of the Chinese Institute of Engineers, 1985 Abstract In this paper, the progress made in the area of designing minimal perfect hashing functions is reviewed. This paper points out that all minimal perfect hashing functions have one common disadvantage: They are only suitable for small key sets. Moreover, a new hashing scheme is proposed.
Chin-Chen Chang, Jiann‐Cherng Shieh
openaire +1 more source
A modulus oriented hash function for the construction of minimal perfect tables
SIGP, 1992Purpose of this paper is to describe an algorithm for the construction of minimal perfect hash tables for small static word sets. As first step we have analysed Cook Oldehoeft's letter oriented algorithm and then we have introduced some modifications to ...
M. Panti, S. Valenti
semanticscholar +1 more source
Perfect hash functions for large dictionaries
Proceedings of the ACM first workshop on CyberInfrastructure: information management in eScience, 2007We describe a new practical algorithm for finding perfect hash functions with no specification space at all, suitable for key sets ranging in size from small to very large. The method is able to find perfect hash functions for various sizes of key sets in linear time.
openaire +2 more sources
Direct Perfect Hashing Functions for External Files
Journal of Database Management, 1991A file organization scheme based on composite perfect hashing, which guarantees single access retrieval from external files has been proposed recently. The ideal retrieval performance is achieved by using an auxiliary internal table and direct perfect hashing.
M.V. Ramakrishna, Yuchi Bannai
openaire +2 more sources
An optimal algorithm for generating minimal perfect hash functions
Information Processing Letters, 1992Abstract A new algorithm for generating order preserving minimal perfect hash functions is presented. The algorithm is probabilistic, involving generation of random graphs. It uses expected linear time and requires a linear number of words to represent the hash function, and thus is optimal up to constant factors. It runs very fast in practice.
Zbigniew J. Czech +2 more
openaire +3 more sources