Results 151 to 160 of about 416,985 (179)
Some of the next articles are maybe not open access.
Preimage Attacks on Full-ARIRANG (Poster)
2011This paper presents ongoing work toward the first preimage attacks on hash function ARIRANG, which is one of the first round candidates in the SHA-3 competition. ARIRANG has an unique design where the feed-forward operation is computed not only after the last step but also in a middle step. In fact, this design prevents previous preimage attacks.
Chiaki Ohtahara +3 more
openaire +2 more sources
Preimage Attacks on Step-Reduced MD5
2008In this paper, we propose preimage attacks on step-reduced MD5. We show that a preimage of a 44-step MD5 can be computed to a complexity of 296. We also consider a preimage attack against variants of MD5 where the round order is modified from the real MD5.
Yu Sasaki 0001, Kazumaro Aoki
openaire +2 more sources
An improved preimage attack against HAVAL-3
Information Processing Letters, 2015Hash functions play an important role in constructing cryptographic schemes that provide security services, such as confidentiality in an encryption scheme, authenticity in an authentication protocol and integrity in a digital signature scheme and so on. Such hash function is needed to process a challenge, a message, an identifier or a private key.
Jian Guo 0001, Chunhua Su, Wun-She Yap
openaire +2 more sources
Second Preimage Attack on SHAMATA-512
2009We present a second preimage attack on SHAMATA-512, which is a hash function of 512-bit output and one of the first round candidates of the SHA-3 competition. The attack controls several message blocks to fix some variables of internal state and uses a meet-in-the-middle approach to find second preimages.
Kota Ideguchi, Dai Watanabe
openaire +2 more sources
A Preimage Attack for 52-Step HAS-160
2009In this paper, we propose preimage attacks on the hash function HAS-160, which is standardized in Korea. We propose two approaches to generate a preimage of step-reduced HAS-160 faster than a brute force attack, which costs 2160. The first approach is a simple application of previously known techniques, which are so-called splice-and-cut ant partial ...
Yu Sasaki 0001, Kazumaro Aoki
+7 more sources
Construction of the Initial Structure for Preimage Attack of MD5
2009 International Conference on Computational Intelligence and Security, 2009The construction of the initial structure for preimage attack of MD5 is proposed in this paper. With the help of “divide-and-rule” technique, the successful possibility of the construction is higher than 2-32 . Our construction is based on the MD5 structure, the message modification technique which is improved from Wang’ s. Some related techniques such
Ming Mao, Shaohui Chen, Jin Xu
openaire +1 more source
A 2nd-Preimage Attack on AURORA-512. [PDF]
IACR Cryptol. ePrint Arch., 2009 In this note, we present a 2nd-preimage attack on AURORA-512, which is one of the candidates for SHA-3. Our attack can generate 2nd-preimages of any given message, in particular, the attack complexity becomes optimal when the message length is 9 blocks ...
Yu Sasaki
core +3 more sources
Meet-in-the-Middle Attacks Revisited: Key-Recovery, Collision, and Preimage Attacks
2021At EUROCRYPT 2021, Bao et al. proposed an automatic method for systematically exploring the configuration space of meet-in-the-middle (MITM) preimage attacks. We further extend it into a constraint-based framework for finding exploitable MITM characteristics in the context of key-recovery and collision attacks by taking the subtle peculiarities of both
Xiaoyang Dong 0001 +5 more
openaire +2 more sources
Preimage Attacks against Variants of Very Smooth Hash
2010In this paper, we show that some new variants of the Very Smooth Hash (VSH) hash function are susceptible to similar types of preimage attacks as the original VSH. We also generalise the previous mathematical results, which have been used in the preimage attacks. VSH is a hash function based on the multiexponentiation of prime numbers modulo some large
Röning Juha, Halunen Kimmo
openaire +1 more source
Distinguishing and Second-Preimage Attacks on CBC-Like MACs
2009This paper first presents a new distinguishing attack on the CBC-MAC structure based on block ciphers in cipher block chaining (CBC) mode. This attack detects a CBC-like MAC from random functions. The second result of this paper is a second-preimage attack on the CBC-MAC, which is an extension of the attack of Brincat and Mitchell.
Keting Jia +3 more
openaire +2 more sources