scholarly journals The Usage of Counter Revisited: Second-Preimage Attack on New Russian Standardized Hash Function

2014 ◽  
pp. 195-211 ◽  
Author(s):  
Jian Guo ◽  
Jérémy Jean ◽  
Gaëtan Leurent ◽  
Thomas Peyrin ◽  
Lei Wang
Keyword(s):  
Hash Function ◽  
Preimage Attack

scholarly journals (Pseudo) Preimage Attack on Round-Reduced Grøstl Hash Function and Others

2012 ◽  
pp. 127-145 ◽  
Author(s):  
Shuang Wu ◽  
Dengguo Feng ◽  
Wenling Wu ◽  
Jian Guo ◽  
Le Dong ◽  
...  
Keyword(s):  
Hash Function ◽  
Preimage Attack

scholarly journals A (Second) Preimage Attack on the GOST Hash Function

2008 ◽  
pp. 224-234 ◽  
Author(s):  
Florian Mendel ◽  
Norbert Pramstaller ◽  
Christian Rechberger
Keyword(s):  
Hash Function ◽  
Preimage Attack

Preimage attack on step reduced hash function HAVAL

2009 ◽  
Vol 29 (5) ◽  
pp. 1327-1329
Author(s):  
Gao-li WANG
Keyword(s):  
Hash Function ◽  
Preimage Attack

scholarly journals Improved Meet-in-the-Middle Preimage Attacks against AES Hashing Modes

2020 ◽  
pp. 318-347
Author(s):  
Zhenzhen Bao ◽  
Lin Ding ◽  
Jian Guo ◽  
Haoyang Wang ◽  
Wenying Zhang
Keyword(s):  
Hash Function ◽  
Time Complexity ◽  
Block Cipher ◽  
The State ◽  
Degree Of Freedom ◽  
Additional Input ◽  
Tweakable Block Cipher ◽  
Preimage Attack

Hashing modes are ways to convert a block cipher into a hash function, and those with AES as the underlying block cipher are referred to as AES hashing modes. Sasaki in 2011, introduced the first preimage attack against AES hashing modes with the AES block cipher reduced to 7 rounds, by the method of meet-in-the-middle. In his attack, the key-schedules are not taken into account. Hence, the same attack applies to all three versions of AES. In this paper, by introducing neutral bits from the key, extra degree of freedom is gained, which is utilized in two ways, i.e., to reduce the time complexity and to extend the attack to more rounds. As an immediate result, the complexities of 7-round pseudo-preimage attacks are reduced from 2120 to 2104, 296, and 296 for AES-128, AES-192, and AES-256, respectively. By carefully choosing the neutral bits from the key to cancel those from the state, the attack is extended to 8 rounds for AES-192 and AES-256 with complexities 2112 and 296. Similar results are obtained for Kiasu-BC, a tweakable block cipher based on AES-128, and interestingly the additional input tweak helps reduce the complexity and extend the attack to one more round. To the best of our knowledge, these are the first preimage attacks against 8-round AES hashing modes.

scholarly journals A Preimage Attack on the MJH Hash Function

2016 ◽  
Vol 26 (2) ◽  
pp. 315-318
Author(s):  
Jooyoung Lee ◽  
Jongsung Kim
Keyword(s):  
Hash Function ◽  
Preimage Attack

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.

Sign in / Sign up

Export Citation Format

Share Document