Results 171 to 180 of about 4,920 (187)
Some of the next articles are maybe not open access.
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, Chunhua Su, Wun-She Yap
openaire +1 more source
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 +1 more source
Distinguishing attack and second preimage attack on Mini-AES CBC-MAC
2014 International Conference of Advanced Informatics: Concept, Theory and Application (ICAICTA), 2014In 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 +1 more
openaire +1 more source
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 +1 more source
Preimage Attacks against PKC98-Hash and HAS-V
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2011We 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
2014We 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 +1 more
openaire +1 more source
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 +5 more
openaire +1 more source
Distinguishing attack and second-preimage attack on encrypted message authentication codes (EMAC)
AIP Conference Proceedings, 2016In 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, 2010DHA-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
2007The 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 +4 more
openaire +1 more source