Results 271 to 280 of about 133,184 (295)
Collision Attack Framework on RIPEMD-128 [PDF]
2020 2nd International Conference on Artificial Intelligence and Advanced Manufacture (AIAM), 2020 In the last few years, the hash functions are the very common and essential primitives implemented in lots of fields. RIPEMD-128, a member of MD-family hash function, has been found collisions on the full round. In this paper, we further analyze the property about the security against collision attack of RIPEMD-128.
Yang Yang, Guang Zeng, Jingyu Li
openaire +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
IEEE Transactions on Information Forensics and Security, 2019
Key enumeration schemes are used to post-process the scores given by side channel distinguishers and enumerate the key candidates from the most possible one to the least possible one, which can be regarded as optimal tools of key search. However, the application of them is limited by very large key candidate space and computing power consumption.
Changhai Ou +3 more
openaire +2 more sources
Key enumeration schemes are used to post-process the scores given by side channel distinguishers and enumerate the key candidates from the most possible one to the least possible one, which can be regarded as optimal tools of key search. However, the application of them is limited by very large key candidate space and computing power consumption.
Changhai Ou +3 more
openaire +2 more sources
Collision Attack on Grindahl [PDF]
Journal of Cryptology, 2014 Hash functions have been among the most scrutinized cryptographic primitives in the previous decade, mainly due to the cryptanalysis breakthroughs on MD-SHAfamily and the NIST SHA-3 competition that followed. Grindahl is a hash function proposed at FSE 2007 that inspired several SHA-3 candidates.
openaire +1 more source
2009 International Conference on Networks Security, Wireless Communications and Trusted Computing, 2009
In 2005, collision resistance of several hash functions was broken by Wang et al. The strategy of determining message differential is the most important part of collision attacks against hash functions. So far, there are only three other message differentials attack published, one of which is 6 bits difference and two are 1 bit difference.
He Debiao, Chen Jianhua, Wang Yu
openaire +2 more sources
In 2005, collision resistance of several hash functions was broken by Wang et al. The strategy of determining message differential is the most important part of collision attacks against hash functions. So far, there are only three other message differentials attack published, one of which is 6 bits difference and two are 1 bit difference.
He Debiao, Chen Jianhua, Wang Yu
openaire +2 more sources
Fault Based Collision Attacks on AES [PDF]
, 2006 In this paper we present a new class of collision attacks that are based on inducing faults into the encryption process. We combine the classical fault attack of Biham and Shamir with the concept of collision attacks of Schramm et al. Unlike previous fault attacks by Blomer and Seifert our new attacks only need bit flips not bit resets.
Johannes Blömer, Volker Krummel
openaire +1 more source