Improved Collision Attacks on the Reduced-Round Grøstl Hash Function

2011 ◽  
pp. 1-16 ◽  
Author(s):  
Kota Ideguchi ◽  
Elmar Tischhauser ◽  
Bart Preneel
Keyword(s):  
Hash Function ◽  
Collision Attacks

Preimage and pseudo-collision attacks on step-reduced SM3 hash function

2013 ◽  
Vol 113 (8) ◽  
pp. 301-306 ◽  
Author(s):  
Gaoli Wang ◽  
Yanzhao Shen
Keyword(s):  
Hash Function ◽  
Collision Attacks

scholarly journals Password Data Authentication Using a Combination of MD5 and Playfair Cipher Matrix 13x13

2020 ◽  
Vol 1 (2) ◽  
pp. 33-36
Author(s):  
Bayu Priyatna ◽  
April Lia Hananto
Keyword(s):  
Data Security ◽  
Hash Function ◽  
Avalanche Effect ◽  
Security Issues ◽  
Cryptographic Algorithm ◽  
Data Authentication ◽  
Message Digest ◽  
Collision Attacks ◽  
Original Message ◽  
Effect Technique

Data security and confidentiality are the most important things that must be considered in information systems. To protect the cryptographic algorithm reliability it uses. MD5 is one technique that is widely used in password data security issues, which algorithm has many advantages including. MD5 has a one-way hash function so that the message has been converted to a message digest, and it is complicated to restore it to the original message (plaintext). In addition to the advantages of MD5 also has a variety of shortcomings including; very easy to solve because MD5 has a fixed encryption result, using the MD5 modifier generator will be easily guessed, and MD5 is not proper because it is vulnerable to collision attacks. The research method used in this study uses Computer Science Engineering by conducting experiments combining two cryptographic arrangements. The results obtained from this study after being tested with Avalanche Effect technique get ciphertext randomness results of 43.69%, which tends to be very strong to be implemented in password data authentication.

Internal differential collision attacks on the reduced-round Grøstl-0 hash function

2012 ◽  
Vol 70 (3) ◽  
pp. 251-271
Author(s):  
Kota Ideguchi ◽  
Elmar Tischhauser ◽  
Bart Preneel
Keyword(s):  
Hash Function ◽  
Collision Attacks

scholarly journals New Semi-Free-Start Collision Attack Framework for Reduced RIPEMD-160

2019 ◽  
pp. 169-192
Author(s):  
Fukang Liu ◽  
Christoph Dobraunig ◽  
Florian Mendel ◽  
Takanori Isobe ◽  
Gaoli Wang ◽  
...  
Keyword(s):  
Hash Function ◽  
Time Complexity ◽  
Hash Functions ◽  
Stream Structure ◽  
Collision Attack ◽  
Time Period ◽  
Collision Attacks ◽  
Memory Complexity ◽  
New Framework

RIPEMD-160 is a hash function published in 1996, which shares similarities with other hash functions designed in this time-period like MD4, MD5 and SHA-1. However, for RIPEMD-160, no (semi-free-start) collision attacks on the full number of steps are known. Hence, it is still used, e.g., to generate Bitcoin addresses together with SHA-256, and is an ISO/IEC standard. Due to its dual-stream structure, even semifree- start collision attacks starting from the first step only reach 36 steps, which were firstly shown by Mendel et al. at Asiacrypt 2013 and later improved by Liu, Mendel and Wang at Asiacrypt 2017. Both of the attacks are based on a similar freedom degree utilization technique as proposed by Landelle and Peyrin at Eurocrypt 2013. However, the best known semi-free-start collision attack on 36 steps of RIPEMD-160 presented at Asiacrypt 2017 still requires 255.1 time and 232 memory. Consequently, a practical semi-free-start collision attack for the first 36 steps of RIPEMD-160 still requires a significant amount of resources. Considering the structure of these previous semi-free-start collision attacks for 36 steps of RIPEMD-160, it seems hard to extend it to more steps. Thus, we develop a different semi-free-start collision attack framework for reduced RIPEMD-160 by carefully investigating the message expansion of RIPEMD-160. Our new framework has several advantages. First of all, it allows to extend the attacks to more steps. Second, the memory complexity of the attacks is negligible. Hence, we were able to mount semi-free-start collision attacks on 36 and 37 steps of RIPEMD-160 with practical time complexity 241 and 249 respectively. Additionally, we describe semi-free-start collision attacks on 38 and 40 (out of 80) steps of RIPEMD-160 with time complexity 252 and 274.6, respectively. To the best of our knowledge, these are the best semi-free-start collision attacks for RIPEMD-160 starting from the first step with respect to the number of steps, including the first practical colliding message pairs for 36 and 37 steps of RIPEMD-160.

scholarly journals Quantum rebound attack to D-M structure based on ARIA algorithm

2021 ◽  
Vol 2078 (1) ◽  
pp. 012003
Author(s):  
Shanque Dou ◽  
Ming Mao ◽  
Yanjun Li ◽  
Dongying Qiu
Keyword(s):  
Quantum Computing ◽  
Hash Function ◽  
Block Cipher ◽  
Security Analysis ◽  
Hash Functions ◽  
Block Ciphers ◽  
Collision Attack ◽  
Cryptographic Algorithms ◽  
Collision Attacks ◽  
Quantum Technology

Abstract With the increasing application of quantum computing, quantum technology is increasingly used in the security analysis and research of multiple symmetric cryptographic algorithms such as block ciphers and hash functions. In 2020, Sasaki et al. proposed a dedicated quantum collision attack against hash functions in EUROCRYPT. Some differential trajectories with a probability of 2−2n/3 that cannot be used in the classical environment may be used to launch collision attacks in the quantum environment. The ARIA algorithm is a block cipher proposed by the Korean researcher Kwon et al. on ICISC 2003. The block cipher algorithm is similar to AES in structure. This article mainly analyzes the security of Davies-Meyer structure, and uses AIRA as the permutation function to construct ARIA hash function based on the DM hash model. A new AIRA differential path was found based on MILP, and 7 rounds of ARIA-DM hash function quantum rebound attacks were given.

Penerapan Kriptografi Keamanan Data Administrasi Kependudukan Desa Pagar Jati Menggunakan SHA-1

2020 ◽  
Vol 3 (2) ◽  
pp. 182-186
Author(s):  
Lisnayani Silalahi ◽  
Anita Sindar
Keyword(s):  
System Application ◽  
Data Security ◽  
Hash Function ◽  
Security System ◽  
Cryptographic Hash Function ◽  
Security Costs ◽  
Encryption Method

Data security and confidentiality is currently a very important issue and continues to grow. Several cases concerning data security are now a job that requires handling and security costs that are so large. To maintain the security and confidentiality of messages, data, or information so that no one can read or understand it, except for the rightful recipients, a data security system application with an encryption method using an algorithm is designed. The SHA-1 cryptographic hash function that takes input and produces a 160-bit hash value which is known as the message iteration is usually rendered as a 40-digit long hexadecimal number.

Near-Collision Attacks on MD4: Applied to MD4-Based Protocols

2009 ◽  
Vol E92-A (1) ◽  
pp. 76-86
Author(s):  
Lei WANG ◽  
Kazuo OHTA ◽  
Noboru KUNIHIRO
Keyword(s):  
Collision Attacks
Sign in / Sign up

Export Citation Format

Share Document