A comprehensive review on collision-resistant hash functions on lattices

Mishra, Nimish; Islam, SK Hafizul; Zeadally, Sherali

doi:10.1016/j.jisa.2021.102782

Cited by 6 publications

(7 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Definition 2. Hash function [23,24] h(•) ∈ HF is defined such that ∀o, o ∈ O, where z = h(o) and z = h(o ), o = o makes z = z .…”

Section: Hash Functionmentioning

confidence: 99%

“…The basic purpose of the Hash function [ 23 , 24 ] is to transmit the data with an information abstract, which is a calculated result of the function. When the data package arrives at the receiver, the information abstract is checked against the new result calculated via the receiver according to the before appoints of the communication participants.…”

Section: Introductionmentioning

confidence: 99%

“…A Hash system is

[ 23 , 24 ], where

is the set of data,

is the set of information,

is the set of keys, and

is the set of Hash functions. For any

, there is

.…”

Section: Introductionmentioning

confidence: 99%

“…The probability of the collision problem is

, where

represents the amount of the elements [ 23 , 24 ].…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Distributed Diagnoses Based on Constructing a Private Chain via a Public Network

Li,

Zhan

2023

Entropy

View full text Add to dashboard Cite

Secure online consultations can provide convenient medical services to patients who require experts from different regions. Moreover, this process can save time, which is critical in emergency cases, and cut medical costs. However, medical services need a high level of privacy protection that advances the difficulty of a construction method. It is a good idea to construct a virtual private chain through public networks by means of cryptology and identity verification. For this purpose, novel protocols are proposed to finish the package layout, secure transmission, and authorization. By mining the special characteristics of this application, two different kinds of encryption channels were designed to support the proposed protocol to ensure the secure transmission of data. And Hash values and multiple checking were employed in the transmission package to find the incompleteness of data related to network errors or attacks. Besides the secure communication of medical information, the Extended Chinese Remainder Theorem was utilized to finish the approval during a change in committee in emergency situations. Finally, example case was used to verify the effectiveness of the total methods.

show abstract

“…Definition 2. Hash function [23,24] h(•) ∈ HF is defined such that ∀o, o ∈ O, where z = h(o) and z = h(o ), o = o makes z = z .…”

Section: Hash Functionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

“…A Hash system is

[ 23 , 24 ], where

is the set of data,

is the set of information,

is the set of keys, and

is the set of Hash functions. For any

, there is

.…”

Section: Introductionmentioning

confidence: 99%

“…The probability of the collision problem is

, where

represents the amount of the elements [ 23 , 24 ].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Distributed Diagnoses Based on Constructing a Private Chain via a Public Network

Li,

Zhan

2023

Entropy

View full text Add to dashboard Cite

show abstract

“…However, it is worth noting that several commonly used hash algorithms, including SHA-1, Snefru, MD4, MD5, RIPEMD, and HAVAL, have been discovered to be vulnerable to collision attacks. Collision attacks occur when two distinct inputs produce the same hash output, compromising the hash function's security [6][7][8]. The National Institute of Standards and Technology (NIST) took proactive measures to address this issue and enhance information security.…”

Section: Introductionmentioning

confidence: 99%

A Novel Hardware Architecture for Enhancing the Keccak Hash Function in FPGA Devices

Sideris,

Sanida,

Dasygenis

2023

Information

View full text Add to dashboard Cite

Hash functions are an essential mechanism in today’s world of information security. It is common practice to utilize them for storing and verifying passwords, developing pseudo-random sequences, and deriving keys for various applications, including military, online commerce, banking, healthcare management, and the Internet of Things (IoT). Among the cryptographic hash algorithms, the Keccak hash function (also known as SHA-3) stands out for its excellent hardware performance and resistance to current cryptanalysis approaches compared to algorithms such as SHA-1 and SHA-2. However, there is always a need for hardware enhancements to increase the throughput rate and decrease area consumption. This study specifically focuses on enhancing the throughput rate of the Keccak hash algorithm by presenting a novel architecture that supplies efficient outcomes. This novel architecture achieved impressive throughput rates on Field-Programmable Gate Array (FPGA) devices with the Virtex-5, Virtex-6, and Virtex-7 models. The highest throughput rates obtained were 26.151 Gbps, 33.084 Gbps, and 38.043 Gbps, respectively. Additionally, the research paper includes a comparative analysis of the proposed approach with recently published methods and shows a throughput rate above 11.37% Gbps in Virtex-5, 10.49% Gbps in Virtex-6 and 11.47% Gbps in Virtex-7. This comparison allows for a comprehensive evaluation of the novel architecture’s performance and effectiveness in relation to existing methodologies.

show abstract

B2L: A hot data identification algorithm by fusing bloom filter and temporal locality for NAND flash based solid-state drives

Yao

Bao

Kong

et al. 2021

Microprocessors and Microsystems

View full text Add to dashboard Cite

A comprehensive review on collision-resistant hash functions on lattices

Cited by 6 publications

References 26 publications

Distributed Diagnoses Based on Constructing a Private Chain via a Public Network

Distributed Diagnoses Based on Constructing a Private Chain via a Public Network

A Novel Hardware Architecture for Enhancing the Keccak Hash Function in FPGA Devices

B2L: A hot data identification algorithm by fusing bloom filter and temporal locality for NAND flash based solid-state drives

Contact Info

Product

Resources

About