Results 151 to 160 of about 4,088 (185)

Distinguishing attack and second preimage attack on Mini-AES CBC-MAC

2014 International Conference of Advanced Informatics: Concept, Theory and Application (ICAICTA), 2014
In this paper, we present a distinguishing attack and second pre-image attack on specific MAC algorithm based on block cipher, Mini-AES CBC-MAC. Conceptually we use Jia et al. methods, but we perform the attacks with smaller input modification. Using smaller input modification, the results are relatively same.
Cahyo Ramdhani Wulamarisman, Susila Windarta   +1 more
openaire   +1 more source

Second Preimage Attack on SHAMATA-512

2009
We 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   +1 more source

Preimage Attacks against PKC98-Hash and HAS-V

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2011
We propose preimage attacks against PKC98-Hash and HAS-V. PKC98-Hash is a 160-bit hash function proposed at PKC 1998, and HAS-V, a hash function proposed at SAC 2000, can produce hash values of 128+32k (k = 0, 1,..., 6) bits. These hash functions adopt the Merkle-Damgard and Davies-Meyer constructions.
Yu Sasaki, Florian Mendel, Kazumaro Aoki
openaire   +1 more source

New Second Preimage Attack Variants against the MD-Structure

2014
We consider a situation where the adversary performs a second preimage attack and is able to influence slightly the preconditions under which the iterated hash function is used. In the first variant of the attack, the adversary is able to choose the initial value of the hash function after receiving the original message.
Kortelainen Juha Matti, Kortelainen Juha Tuomas   +1 more
openaire   +1 more source

Meet-in-the-Middle Attacks Revisited: Key-Recovery, Collision, and Preimage Attacks

2021
At 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, Jialiang Hua, Siwei Sun, Zheng Li, Xiaoyun Wang, Lei Hu   +5 more
openaire   +1 more source

Distinguishing attack and second-preimage attack on encrypted message authentication codes (EMAC)

AIP Conference Proceedings, 2016
In this paper we show that distinguisher on CBC-MAC can be applied to Encrypted Message Authentication Code (EMAC) scheme. EMAC scheme in general is vulnerable to distinguishing attack and second preimage attack. Distinguishing attack simulation on AES-EMAC using 225 message modifications, no collision have been found.
Sigit Ariwibowo, Susila Windarta
openaire   +1 more source

One-block preimage attack on 27-step DHA-256

2010 IEEE International Conference on Progress in Informatics and Computing, 2010
DHA-256 is a dedicated hash function, which is a variation of SHA-256 and designed to enhance SHA-256 security. In this paper, we show one-block second preimage and preimage attacks on 27-step DHA-256 with the time complexity of 2224.45 compression function operations and 232 × 9 words memory.
Jinmin Zhong, Xuejia Lai
openaire   +1 more source

Preimage Attack on the Parallel FFT-Hashing Function

2007
The parallel FFT-Hashing function was designed by C. P. Schnorr and S. Vaudenay in 1993. The function is a simple and light weight hash algorithm with 128-bit digest. Its basic component is a multipermutation which helps in proving its resistance to collision attacks.
Donghoon Chang, Moti Yung, Jaechul Sung, Seokhie Hong, Sangjin Lee   +4 more
openaire   +1 more source

Preimage Attacks on Step-Reduced SM3 Hash Function

2012
This paper proposes a preimage attack on SM3 hash function reduced to 30 steps. SM3 is an iterated hash function based on the Merkle-Damgard design. It is a hash function used in applications such as the electronic certification service system in China. Our cryptanalysis is based on the Meet-in-the-Middle (MITM) attack.
Jian Zou, Wenling Wu, Shuang Wu, Bozhan Su, Le Dong   +4 more
openaire   +1 more source

Distinguishing and Second-Preimage Attacks on CBC-Like MACs

2009
This 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, Xiaoyun Wang, Zheng Yuan, Guangwu Xu   +3 more
openaire   +1 more source