Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 6,502 papers for “Hash function”

The Hash Function BLAKE

Jean-Philippe Aumasson, Willi Meier, Raphaël C.‐W. Phan et al. · Information security and cryptography · 2014

Cited by 44

Modern Hash Function Construction

B. Denton, R. Adhami · 2012

Abstract- This paper discusses modern hash function construction using the NIST SHA-3 competition as a survey of modern hash function construction properties. Three primary hash function designs are identified based on the designs of SHA-3 candidates submitted as part of the NIST SHA-3 competition. These designs are Widepipe, Sponge, and HAsh Iterated FrAmework (HAIFA). Keywords- cryptography; hashing; hash function 1

Cited by 0

The exponential hash function

Abdallah, Chaouki T., Smith, Bradley J., Heileman, Gregory L. · UNM’s Digital Repository (University of New Mexico) · 2012

In this paper an efficient open address hash function called exponential hashing is developed. The motivation for this hash function resulted from our ongoing efforts to apply dynamical systems theory to the study of hashing; however, the analysis conducted in this paper is primarily based on traditional number theory. Proofs of optimal table parameter choices are provided for a number of hash functions. We also demonstrate experimentally that exponential hashing essentially matches the performance of a widely-used optimal double hash function for uniform data distributions, and performs significantly better for nonuniform data distributions. We show that exponential hashing exhibits a higher integer Lyapunov exponent and entropy than double hashing for initial data probes, which offers one explanation for its improved performance on nonuniform data distributions.

Cited by 0

Cryptographic hash function SafeBK

Каріна Сергіївна Безверха, Василь Миколайович Кінзерявий, Андрій Іванович Гізун · Ukrainian Scientific Journal of Information Security · 2017

The application of web technologies and forms of electronic document circulation in the process of information exchange between users though simplifies this process, however, generates a number of new threats to the confidentiality, integrity and availability of information and the appearance of previously unknown vulnerabilities. One of the most common methods of protection is the use of digital certificates that ensure the confidential exchange of data between a client and a server by encrypting and authenticating a digital certificate. A digital certificate is a public key, certified by the EDS of the certification center. However, a digital certificate is not just a public key with information, but a so-called signature of a server or web resource that is implemented using the hex functions. However, with the development of information technology and the emergence of new types of attacks, leads to an increase in the number of disadvantages of existing gash functions. Thus, in the paper a new heaching function was proposed, which was developed on the basis of the SHA-2 hex function. Improvements involved the introduction of a number of changes: increased the size of words and an increase in the message digest; At the pre-processing stage, the incoming message is supplemented by a pseudo-random sequence; the number of nonlinear functions is increased. The proposed changes allow to reduce the number of rounds in the compression function, which will guarantee at least similar stability indicators with simultaneous increase in data processing speed.

Cited by 0Open access

Hash Function for geometry Reconstruction

Václav Skala · 2000

Abstract. There are many applications where data structures use a hash function. The hash data structures are widely used across all fields of computer science. Nevertheless the design or selection of hash function for data sets with unknown properties is a problem. The Rapid Prototyping uses STL format, where a set of triangles is used to represent a surface of the object. It is necessary to construct the regular triangular mesh from the STL data format for many applications. It is a lengthy process for large data sets as the time complexity of this process is O(N2) or O(N lgN) , where N is a number of triangles. The hash table can be used to speed up the process but the speed strongly depends on hash function properties. This paper describes a new hash function and presents properties obtained on large data sets.

Cited by 0

Learning Hash Function through Codewords

Yinjie Huang, Michael Georgiopoulos, Georgios C. Anagnostopoulos · arXiv (Cornell University) · 2019

In this paper, we propose a novel hash learning approach that has the following main distinguishing features, when compared to past frameworks. First, the codewords are utilized in the Hamming space as ancillary techniques to accomplish its hash learning task. These codewords, which are inferred from the data, attempt to capture grouping aspects of the data's hash codes. Furthermore, the proposed framework is capable of addressing supervised, unsupervised and, even, semi-supervised hash learning scenarios. Additionally, the framework adopts a regularization term over the codewords, which automatically chooses the codewords for the problem. To efficiently solve the problem, one Block Coordinate Descent algorithm is showcased in the paper. We also show that one step of the algorithms can be casted into several Support Vector Machine problems which enables our algorithms to utilize efficient software package. For the regularization term, a closed form solution of the proximal operator is provided in the paper. A series of comparative experiments focused on content-based image retrieval highlights its performance advantages.

Cited by 0Open access

The Skein Hash Function Family

Doug Whiting Hifn Inc · 2008

Skein is a new family of cryptographic hash functions. Its design combines speed, security, simplic-ity, and a great deal of flexibility in a modular package that is easy to analyze. Skein is fast. Skein-512—our primary proposal—hashes data at 6.1 clock cycles per byte on a 64-bit CPU. This means that on a 3.1 GHz x64 Core 2 Duo CPU, Skein hashes data at 500 MBytes/second per core—almost twice as fast as SHA-512 and three times faster than SHA-256. An optional hash-tree mode speeds up parallelizable implementations even more. Skein is fast for short messages, too; Skein-512 hashes short messages in about 1000 clock cycles. Skein is secure. Its conservative design is based on the Threefish block cipher. Our current best attack on Threefish-512 is on 25 of 72 rounds, for a safety factor of 2.9. For comparison, at a similar stage in the standardization process, the AES encryption algorithm had an attack on 6 of 10 rounds, for a safety factor of only 1.7. Additionally, Skein has a number of provably secure properties, greatly increasing confidence in the algorithm. Skein is simple. Using only three primitive operations, the Skein compression function can be easily understood and remembered. The rest of the algorithm is a straightforward iteration of this function.

Cited by 0

A Perfect Hash Function Generator

Douglas Schmidt Schmidt · 1990

gperf is a "software-tool generating-tool" designed to automate the generation of perfect hash functions. This paper describes the features, algorithms, and object-oriented design and implementation strategies incorporated in gperf.Italso presents the results from an empirical comparison between gperf-generated recognizers and other popular techniques for reserved word lookup. gperf is distributed with the GNU libg++ library and is used to generate the keyword recognizers for the GNU C and GNU C++ compilers. 1 Introduction Perfect hash functions are a time and space efficient implementation of static search sets, which are ADTs with operations like initialize, insert,andretrieve. Static search sets are common in system software applications. Typical static search sets include compiler and interpreter reserved words, assembler instruction mnemonics, and shell interpreter builtin commands. Search set elements are called keywords.Key- words are inserted into the set once, usually at c...

Cited by 0

The Whirlpool Secure Hash Function

William Stallings · Cryptologia · 2006

ABSTRACT In this paper, we describe Whirlpool, which is a block-cipher-based secure hash function. Whirlpool produces a hash code of 512 bits for an input message of maximum length less than 2256 bits. The underlying block cipher, based on the Advanced Encryption Standard (AES), takes a 512-bit key and operates on 512-bit blocks of plaintext. Whirlpool has been endorsed by NESSIE (New European Schemes for Signatures, Integrity, and Encryption), which is a European Union-sponsored effort to put forward a portfolio of strong cryptographic primitives of various types.

Cited by 35

Timestamp Injected Cryptographic Hash Function to Reduce Fabrication of Hash Collisions

Zulfany Erlisa Rasjid, Gunawan Witjaksono, Benfano Soewito et al. · International Journal of Recent Technology and Engineering (IJRTE) · 2019

Cryptographic hash functions are used in many applications. One important application is to ensure data integrity. Although there are many different types of hashing algorithms, MD5 is widely used to ensure data integrity in digital evidence. However, a weakness, where collisions can occur, has been found in the MD5 algorithm. With regards to digital evidence, this is a big issue. The integrity of the digital evidence becomes questionable due to collisions and hence it is not admissible in court. Many methods were used to find collisions, such as the Chosen-Prefix Collision and researchers have been improving collision finding algorithms. This paper concentrates on reducing the chances of collision by chopping the last 16 bits of the MD5 algorithm and injecting timestamp into the chopped parts. Experiments are performed to test this algorithm and the results show that the time taken to find collisions is longer using the MD5 with an injected timestamp. The chopping construction and the timestamp disrupt the iterative property of the hash function thus when dealing with digital evidence, there are less chances of hash collision and therefore the probability of the admissibility of the digital evidence in court is higher.

Cited by 0Open access