On the design of special hash functions for multiple hash tables

2012 ◽  
Author(s):  
Eleazar Jimenez Serrano
Keyword(s):  
Hash Functions ◽  
Hash Tables

scholarly journals How to Hash a Set

2017 ◽  
Author(s):  
RIchard O'Keefe
Keyword(s):  
Data Structure ◽  
Hash Functions ◽  
Symmetric Polynomials ◽  
Hash Tables ◽  
Commutative Semigroups

Hash tables are widely used. They rely on good quality hash functions. Popular data structure libraries either provide no hash functions or weak hash functions for sets or maps, making it impossible or impractical to use them as keys in other tables. This article presents three algorithms for hashing a set, two of which are simple to implement, practically fast, and can be combined. The quality evaluations follow the method of [1, chapter 2]. The insight that we are looking for commutative semigroups suggests that even better methods than symmetric polynomials may be found.

scholarly journals Performance of Cryptographic Hash function used in Digital Forensic tools

2021 ◽  
Keyword(s):  
Hash Functions ◽  
Hash Tables ◽  
Cyber Forensics ◽  
Hard Drives ◽  
Storage Devices ◽  
Digital Forensic ◽  
Length Data ◽  
Forensic Tools ◽  
Evaluation Of Evidence ◽  
Image Archives

Cryptographic hash functions are which transform any long message to fixed-length data. It seeks to ensure the confidentiality of the data through the cryptographic hash. The digital forensic tool is a method for extracting information from various storage devices, such as hard drives, memory. SHA-1 and SHA-2 methods are both widely used in forensic image archives. The hash method is usually used during evidence processing, the checking of forensic images (duplicate evidence), then at the completion of the analysis again to ensure data integrity and forensic evaluation of evidence. There was a vulnerability called a collision in the hashing algorithm in which two independent messages had the same hash values. While SHA-3 is secure than its former counterparts, the processors for general purposes are being slow and are not yet so popular. This task proposes a basic yet successful framework to meet the needs of cyber forensics, combining hash functions with other cryptographic concepts, for instance, SALT, such as modified secured hash algorithm (MSHA). A salt applies to the hashing mechanism to make it exclusive, expand its complexity and reduce user attacks like hash tables without increasing user requirements.

Hash Functions Based on Block Ciphers

2009 ◽  
Vol 20 (3) ◽  
pp. 682-691
Author(s):  
Pin LIN ◽  
Wen-Ling WU ◽  
Chuan-Kun WU
Keyword(s):  
Hash Functions ◽  
Block Ciphers

Data Integrity

2017 ◽  
Author(s):  
Keith M. Martin
Keyword(s):  
Hash Function ◽  
Hash Functions ◽  
Data Integrity ◽  
Message Authentication ◽  
Authenticated Encryption ◽  
Authentication Codes ◽  
Basic Model ◽  
Function Design ◽  
Security Properties ◽  
Different Levels

This chapter discusses cryptographic mechanisms for providing data integrity. We begin by identifying different levels of data integrity that can be provided. We then look in detail at hash functions, explaining the different security properties that they have, as well as presenting several different applications of a hash function. We then look at hash function design and illustrate this by discussing the hash function SHA-3. Next, we discuss message authentication codes (MACs), presenting a basic model and discussing basic properties. We compare two different MAC constructions, CBC-MAC and HMAC. Finally, we consider different ways of using MACs together with encryption. We focus on authenticated encryption modes, and illustrate these by describing Galois Counter mode.

Minimal perfect hash functions for reserved word lists

1985 ◽  
Vol 20 (12) ◽  
pp. 47-53 ◽  
Author(s):  
Robert W. Sebasta ◽  
Mark A. Taylor
Keyword(s):  
Hash Functions ◽  
Word Lists
Sign in / Sign up

Export Citation Format

Share Document