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

scholarly journals Alpha-DBL: A Reasonable High Secure Double-Block-Length Hash Function

2021 ◽  
Vol 2 (12) ◽  
pp. 11-17
Author(s):  
Hoang Dinh Linh ◽  
Tran Hong Thai
Keyword(s):  
Hash Function ◽  
Security Analysis ◽  
Block Size ◽  
Block Length ◽  
Preimage Resistance ◽  
Single Block ◽  
Double Block Length ◽  
Function Construction ◽  
Security Bound ◽  
Better Than

Abstract—We propose a new double-block-length compression function which is called Alpha-DBL. This scheme uses two parallel secure single block length schemes based on a block cipher with -bit key and -bit block size to compress a -bit string to a -bit one. We show that the Alpha-DBL scheme attains nearly optimal collision security and preimage security bounds (up to  and  queries for finding a collision and a preimage, respectively). More precisely, for , no adversary making less than  queries can find a collision with probability greater than 1/2. To our knowledge, this collision security bound is nearly better than other such compression functions. In addition, we provide a preimage security analysis of Alpha-DBL that shows security bound of  queries for . Using this scheme in the iterated hash function construction can preserve the collision resistance security and the preimage resistance security.Tóm tắt—Chúng tôi đề xuất một hàm nén độ dài khối kép mới được gọi là Alpha-DBL. Lược đồ này sử dụng hai lược đồ độ dài khối đơn an toàn song song dựa trên mã khối với khóa -bit và kích thước khối -bit để nén chuỗi -bit thành chuỗi -bit. Chúng tôi đã chứng minh rằng, lược đồ Alpha-DBL đạt được cận an toàn kháng va chạm và kháng tiền ảnh gần như tối ưu (tối đa  và  truy vấn tương ứng để tìm va chạm và tiền ảnh). Cụ thể với , một kẻ tấn công bất kỳ thực hiện ít hơn  truy vấn chỉ có thể tìm thấy một va chạm với xác suất nhỏ hơn 1/2. Theo hiểu biết của chúng tôi, cận an toàn kháng va chạm này tốt hơn so với các hàm nén khác. Ngoài ra, chúng tôi đã đưa ra phân tích độ an toàn kháng tiền ảnh của Alpha-DBL cho thấy cận an toàn là 2  truy vấn cho . Sử dụng lược đồ này trong việc xây dựng hàm băm được lặp có thể bảo toàn độ an toàn kháng va chạm và an toàn kháng tiền ảnh. 

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

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

Security analysis of a one-way hash function based on spatiotemporal chaos

2011 ◽  
Vol 20 (9) ◽  
pp. 090504 ◽  
Author(s):  
Shi-Hong Wang ◽  
Peng-Yang Shan
Keyword(s):  
Hash Function ◽  
Security Analysis ◽  
Spatiotemporal Chaos

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.

scholarly journals Security Analysis of LNMNT-LightWeight Crypto Hash Function for IoT

IEEE Access ◽  
2021 ◽  
pp. 1-1
Author(s):  
Nubila Nabeel ◽  
Mohamed Hadi Habaebi ◽  
M D. Rafiqul Islam
Keyword(s):  
Hash Function ◽  
Security Analysis

scholarly journals Keyed one-way Hash function construction based on the chaotic dynamic S-Box

2006 ◽  
Vol 55 (9) ◽  
pp. 4442
Author(s):  
Guo Xian-Feng ◽  
Zhang Jia-Shu
Keyword(s):  
Hash Function ◽  
Chaotic Dynamic ◽  
Function Construction

User Authentication Scheme for Internet of Things Using Near-Field Communication

2020 ◽  
Vol 27 (05) ◽  
pp. 2040012
Author(s):  
Muhammad H. Alharbi ◽  
Omar H. Alhazmi
Keyword(s):  
Internet Of Things ◽  
Private Information ◽  
Hash Function ◽  
User Authentication ◽  
Near Field ◽  
Security Analysis ◽  
Xor Operation ◽  
Different Types ◽  
User Authentication Scheme ◽  
The Internet Of Things

In the Internet of things (IoT), the user authentication process is becoming more critical with the growing number of the services provided by IoT. Securing access to these services by the user authentication process leads to high security to prevent any attack on the IoT network. The approach keeps the private information secured efficiently and ensuring that only authorized users can access this information. The proposed scheme uses only Chaskey hash function and XOR operation. The security analysis proves that it is immune to different types of attacks. Furthermore, the scheme is faster, lighter on resources and energy consumption compared to other existing schemes. Finally, we compare the proposed scheme to several other existing schemes on several aspects highlighting main differences.

Sign in / Sign up

Export Citation Format

Share Document