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”

PERFECT PANGRAM HASH : Anagram Hash Function

Byrl Raze Buckbriar · Zenodo (CERN European Organization for Nuclear Research) · 2026

A pangram is a sentence or phrase that contains each letter of an alphabetor character set at least once. A perfect pangram is an anagram of thealphabet which contains each letter exactly once. Pangram hash generates a perfect pangram hash digest consisting of aanagram permutation of a character set. Each character in the output isunique and non-repeating. Below is purely procedural source code written in the FreePascalprogramming language. Instructions and explanatory comments are locatedin the source code. A plain text source file is embedded in the PDFdocument. Additional resource files are also embedded in the PDF file.

Cited by 0Open access

PERFECT PANGRAM HASH : Anagram Hash Function

Byrl Raze Buckbriar · Zenodo (CERN European Organization for Nuclear Research) · 2026

Cited by 0Open access

Cryptographic Hash Function

Danilo Gligoroski, Rune Steinsmo Ødegård, Marija Mihova et al. · 2011

This is the version 02 of the supporting documentation that describes in details the cryptographic hash function EDON-R which was submitted as a candidate for SHA-3 hash competition organized by National Institute of Standards and Technology (NIST), according to the public call [1]. The difference between version 01 and version 02 of the documentation is in the produced test vectors for HMAC. That is due to the fact that there was mismatch between rotation values defined in the documentation and implemented C code. Accordingly, C source code (in the accompanied CD) has been changed with the correct rotation values. So, in this documentation we do not change anything in the originally submitted algorithm, but just give the correct HMAC test values. In this version a minor change in the performance has been measured with Microsoft Visual Studio 2005, but we add new measurements performed by Intel C++ v 11.0.066 (that are slightly better than those obtained by Microsoft Visual Studio 2005). Additionally, we put a remark that our claims about free-start collisions in the Section 3.14 are not correct. EDON-R is a cryptographic hash function with output size of n bits where n = 224, 256, 384 or 512. Its conjectured cryptographic security is: O(2 n 2) hash computations for finding collisions, O(2n) hash computations for finding preimages, O(2n−k) hash computations for finding second preimages

Cited by 0

Cryptographic hash function.

Evans Osei Kofi (15285194), Emmanuel Ahene (15285197) · Figshare · 2023

<div><p>Hash collisions and redirection of loads are major limitations for recent Hash IP algorithms. To overcome this, we propose a new Hash IP algorithm dubbed HDW in network load balancing (NLB) to increase network’s efficiency, availability and scalability. We achieve the new Hash IP load balancing algorithm via a constructive merger with weighted scheduler (WS) technique and dynamic switching of routing path (DSP). This helps to reduce delays, jitters and additionally assures some level of security owing to the hashing process. Our findings after comprehensive simulations and performance evaluation depicts that our proposed HDW algorithm is relatively efficient as against other related load balancing algorithms for software defined network.</p></div>

Cited by 0Open access

MD5 Hash Function

2011

Cited by 1

MD4 Hash Function

2011

Cited by 0

Cryptographic hash function

Petr Čejka · Digital Repository (National Repository of Grey Literature) · 2013

The goal of this thesis is to create overview about cryptographic hash fiction. In the first part is explained what general hash function is with its use. Follows specification of cryptographic hash function with a description of the most common construction. The next chapter is focused on application of cryptographic hash function in practice with emphasis to digital signature. After this chapter is attention paid to security. At the end are presented the most popular and the most important representatives of cryptographic hash function.

Cited by 0

SM3 Hash function

Sean Shen · 2014

This document discribles a hash function which is invented by Xiaoyun Wang et al. This algorithm is published by Chinese Commercial Cryptography Administration Office ([SM3]) for the use of electronic authentication service system. This document gives IETF standard description of the algorithm.

Cited by 0

MGR Hash Function

Khushboo Bussi, Dhananjoy Dey, P. R. Mishra et al. · 2015

GOST-R is a Russian Standard Cryptographic Hash function which was first introduced in 1994 by Russian Federal for information processing, in-formation security and digital signature. In 2012, it was updated to GOST-R 34.11-2012 and replaced older one for all its applications from January 2013. GOST-R is based on modified Merkle-Damg̊ard construction. Here, we present a modified version of GOST-R (MGR-hash). The modified design is based on wide pipe construction which is also a modified Merkle-Damg̊ard construction. MGR is much more secure as well as three times faster than GOST-R. AES like block cipher has been used in designing the compression function of MGR because AES is one of the most efficient and secure block cipher and it has been evaluated for more than 12 years. We will also analyze the MGR hash function with respect to its security and efficiency.

Cited by 0

MD4 Hash Function

Sushil Jajodia, Pierangela Samarati, Moti Yung · 2025

Cited by 0

MD5 Hash Function

Sushil Jajodia, Pierangela Samarati, Moti Yung · 2025

Cited by 0

hash function pdf

hlpprsmd · Zenodo (CERN European Organization for Nuclear Research) · 2024

&lt;pre&gt;&lt;code&gt;\n&lt;p&gt;&lt;strong&gt;hash function pdf&lt;/strong&gt;&lt;br&gt;&lt;/p&gt;\n&lt;p&gt;Rating: 4.8 / 5 (2859 votes)&lt;br&gt;&lt;/p&gt;\n&lt;p&gt;Downloads: 28922&lt;br&gt;&lt;br&gt;&lt;/p&gt;\n &lt;p&gt;= = = = = \n&lt;strong&gt;&lt;a href="https://tds11111.com/21Nr9y?keyword=hash function pdf" target="_blank"&gt;CLICK HERE TO DOWNLOAD&lt;/a&gt;&lt;/strong&gt;\n = = = = = &lt;br&gt;&lt;br&gt;&lt;/p&gt;\n&lt;p&gt;&lt;br&gt;&lt;br&gt;&lt;br&gt;&lt;br&gt;&lt;/p&gt;\n&lt;p&gt;&lt;br&gt;&lt;br&gt;&lt;br&gt;&lt;br&gt;&lt;/p&gt;\n&lt;p&gt;&lt;br&gt;&lt;br&gt;SHA = Secure hash algorithm [NIST] SHA= Updated SHA. SHA= SHA, SHA, SHA, SHA SHA uses bit operations Hash Function Security In Theory The way around this technical issue is to introduce some randomness into the libraries and into the inputs of H. We de˙ne hash functions to take two arguments: a randomly chosen, public value s called a salt, and an adversarially chosen input x. "Modern, collision resistant hash functions were designed to create small, fixed size message digests so that a digest could act as a proxy for a possibly very large variable length message in a digital signature algorithm, such as RSA or DSA. These hash functions have since been widely used for many other "ancillary Pre-key attack phase A cryptographic hash function has the same properties as ordinary hash functions: it is easy to compute, takes an arbitrarily long input string (or file), and it produces a random-looking, fixed-length, output string. The values returned by a hash function are called "hash values," "hash codes," or "hashes." Two important propertiesIf given the same input, the hash function must return the same output. A hash function should satisfy main two properties: one-wayness and. For a Key Hash k =function Hashed valuek =FigureCollision Using a Modulus Hash Function Collision Resolution The hash table can be implemented either using BucketsIn this note we discuss the extent to which the hash functions can be thought of as black boxes, review some recent attacks, and, most importantly, revisit common applications of hash functions in programming practice. MD4 = Message Digest[RFC ]b operations. For example, the most common hash function used today, SHA, outputs bits (bytes), no matter the length of the input What is a hash function? SHA = Secure hash Cryptographic Hash Functions A hash function maps a message of an arbitrary length to a m-bit output – output known as the fingerprint or the message digest – if the What are they good for? string), returns a corresponding hash value (usually a number). MD4 = Message Digest[RFC ]b operations. Definition A hash function H is collision-resistant if LH cr-real What are they good for? (This is Big Idea in Hashing Let S={a 1,a 2, am} be a set of objects that we need to map into a table of size N. Find a function such that H:S [1 n] Ideally we'd like to have a map But it is not easy to find one Also function must be easy to compute It is a good idea to pick a prime as the table size to have a better distribution of values Cryptographic Hash Functions A hash function maps a message of an arbitrary length to a m-bit output – output known as the fingerprint or the message digest – if the message digest is transmitted securely, then changes to the message can be detected A hash is a many-to-one function, so collisions can happen Examples of Crypto Hash Functions. In its simplest form, What is a hash function? In many applications, we also want the hash function to "look random". Given an input of a particular type (e.g. The most basic security property of a hash function is collision-resistance, which measures the ability of an adversary to find a collision for HK. There are different notions of collision-resistance, varying in restrictions put on the adversary in its quest for a collision. Any encoding will do as long as it satisfies theSee more Random Oracle Model (Andrés) and Some Applications (Kyle) RecitationRandom Oracle Model (ROM) Ideal Hash Function. "Modern, collision resistant hash functions were designed to create small, fixed size message digests so that a digest could act as a proxy for a We survey theory and applications of cryptographic hash functions, such as MD5 and SHA-1, especially their resistance to collision-finding attacks. We review defini-tions, ision Tree. A hash function should satisfy main two find a value using some kind of a "function" that maps keys to values. string), returns a corresponding hash value (usually a number). Given an input of a particular type (e.g. The note assumes no previous background in cryptography Random Oracle Model (Andrés) and Some Applications (Kyle) RecitationRandom Oracle Model (ROM) Ideal Hash Function. FigureMerkle-Damg ̊ard construction. collision resistance. MD5 = Message Digest[RFC ]b operations. The values returned by a hash function Examples of Crypto Hash Functions. MD5 = Message Digest[RFC ]b operations. There is a certain flexibility in the first two steps of the Merkle-Damg ̊ard construction. The key for a given object can be calculated using a function called a hash function. An internal node represents a binary comparison, branching either True or False. HK(x1) = HK(x2). Any algorithm can be viewed as a ision tree of operations performed. Basic properties of a hash function =!=&gt; random function!&lt;/p&gt;&lt;/code&gt;&lt;/pre&gt;

Cited by 0Open access

Cryptographic Hash Function

Olakunle Esuruoso, Olakunle Esuruoso · 2011

Cited by 0

Fully Quantum Hash Function

Shreya Banerjee, H. N. Meena, Somanath Tripathy et al. · arXiv (Cornell University) · 2024

We introduce a novel, \textit{fully} quantum hash (FQH) function within the quantum walk on a cycle framework. We incorporate deterministic quantum computation with a single qubit to replace classical post-processing, thus increasing the inherent security. Further, our proposed hash function exhibits zero collision rate and high reliability. We further show that it provides $ > 50\%$ avalanche on average, and is highly sensitive to the initial conditions. We show comparisons of several performance metrics for the proposed FQH with different settings as well as with existing protocols to prove its efficacy. FQH requires minimal quantum resources to produce a large hash value, providing security against the birthday attack. This innovative approach thus serves as an efficient hash function and lays the foundation for potential advancements in quantum cryptography by integrating the fully quantum hash generation protocol.

Cited by 0Open access

The MD6 Hash Function

Ronald L. Rivest, Benjamin Agre, Daniel V. Bailey et al. · 2012

This report describes and analyzes the MD6 hash function, an entry in the NIST SHA-3 hash function competition 1. Significant features of MD6 include: • Accepts input messages of any length up to 2 64 − 1 bits, and produces message digests of any desired size from 1 to 512 bits, inclusive, including

Cited by 0

The Lane hash function

Sebastiaan Indesteege, Elena Andreeva, Christophe De Cannière et al. · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2009

We propose the cryptographic hash function Lane as a candidate for the SHA-3 competition organised by NIST. Lane is an iterated hash function supporting multiple digest sizes. Components of the AES block cipher are reused as building blocks. Lane aims to be secure, easy to understand, elegant and flexible in implementation.

Cited by 35Open access

Robust Speech Hash Function

Ning Chen · ETRI Journal · 2010

In this letter, we present a new speech hash function based on the non-negative matrix factorization (NMF) of linear prediction coefficients (LPCs). First, linear prediction analysis is applied to the speech to obtain its LPCs, which represent the frequency shaping attributes of the vocal tract. Then, the NMF is performed on the LPCs to capture the speech's local feature, which is then used for hash vector generation. Experimental results demonstrate the effectiveness of the proposed hash function in terms of discrimination and robustness against various types of content preserving signal processing manipulations.

Cited by 13

Hash function construct used in SKINNY-tk3-hash.

Sonal Arvind Barge (20454967), Gerardine Immaculate Mary (20454970) · Figshare · 2024

<div><p>The increasing popularity and prevalence of Internet of Things (IoT) applications have led to the widespread use of IoT devices. These devices gather information from their environment and send it across a network. IoT devices are unreliable due to their susceptibility to defect that arise intentionally or spontaneously. IoT devices must be dependable and secure since they form an integral part of the network that connects millions of connected objects. IoT devices are secured by cryptographic algorithms, but their dependability is a major concern. Concurrent error detection (CED) techniques, sometimes referred to as fault detection techniques, are extensively employed to enhance the dependability of embedded devices. Two fault detection approaches are proposed to detect faults in cryptographic algorithms running on IoT devices. Recomputing with complemented operands (RECO) and Double modular redundancy with complemented operands (DMRC) is proposed. Generally, IoT applications deploy resource-constrained devices and cannot support high-level security techniques. Therefore, the mentioned fault detection technique is assimilated for the lightweight SKINNY block cipher. The resource-sharing concept is applied to the SKINNY block cipher to reduce area overhead caused by DMRC. The SKINNY-Hash function construct is described using Very Large-Scale Hardware Description Language (VHDL). Functional behaviour is tested using ModelSim SE-64. The proposed architecture is synthesised using the Genus synthesis tool by Cadence, and area-power reports are generated. The proposed work is compared with the other CED techniques in terms of area and power consumption, and the work proves to have less overhead.</p></div>

Cited by 0Open access