scholarly journals One-way Hash function construction based on two-dimensional hyper-chaotic mappings

2005 ◽  
Vol 54 (10) ◽  
pp. 4562
Author(s):  
Peng Fei ◽  
Qiu Shui-Sheng ◽  
Long Min
Keyword(s):  
Hash Function ◽  
Two Dimensional ◽  
Function Construction

An Efficient Match Search Approach Using Two-Dimensional Hash Function in Hardware-Based Dictionary Compression

2019 ◽  
Vol 28 (06) ◽  
pp. 1950106
Author(s):  
Qian Dong ◽  
Bing Li
Keyword(s):  
Compression Ratio ◽  
Hash Function ◽  
High Speed ◽  
Two Dimensional ◽  
Time Data ◽  
Search Result ◽  
Compression Speed ◽  
Real Time Data ◽  
Real Time Data Processing ◽  
Search Approach

The hardware-based dictionary compression is widely adopted for high speed requirement of real-time data processing. Hash function helps to manage large dictionary to improve compression ratio but is prone to collisions, so some phrases in match search result are not true matches. This paper presents a novel match search approach called dual chaining hash refining, which can improve the efficiency of match search. From the experimental results, our method showed obvious advantage in compression speed compared with other approach that utilizes single hash function described in the previous publications.

scholarly journals The suffix-free-prefix-free hash function construction and its indifferentiability security analysis

2012 ◽  
Vol 11 (6) ◽  
pp. 419-434 ◽  
Author(s):  
Nasour Bagheri ◽  
Praveen Gauravaram ◽  
Lars R. Knudsen ◽  
Erik Zenner
Keyword(s):  
Hash Function ◽  
Security Analysis ◽  
Function Construction

Parallel keyed hash function construction based on chaotic maps

2008 ◽  
Vol 372 (26) ◽  
pp. 4682-4688 ◽  
Author(s):  
Di Xiao ◽  
Xiaofeng Liao ◽  
Shaojiang Deng
Keyword(s):  
Hash Function ◽  
Chaotic Maps ◽  
Keyed Hash Function ◽  
Function Construction

HASH FUNCTION CONSTRUCTION BASED ON THE CHAOTIC LOOK-UP TABLE WITH CHANGEABLE PARAMETER

2011 ◽  
Vol 25 (29) ◽  
pp. 3835-3851 ◽  
Author(s):  
YANTAO LI ◽  
DI XIAO ◽  
SHAOJIANG DENG
Keyword(s):  
Performance Analysis ◽  
Hash Function ◽  
Look Up Table ◽  
Original Message ◽  
Function Construction ◽  
Changeable Parameter

In this paper, we propose an algorithm for one-way hash function construction based on the chaotic look-up table with changeable parameter. First, the original message with padding is divided into block messages as groups and then further broken into sub-block messages, which are translated into corresponding ASCII codes by groups. Then the group ASCII codes are successively inputted into the chaotic look-up table updated by changeable parameter to permute corresponding values. Finally, based on the calculation of the values, 128-bit hash value is generated. Performance analysis indicates that our proposed algorithm satisfies sensitive requirements and can resist all kinds of attacks.

Sign in / Sign up

Export Citation Format

Share Document