Fixed Point Attack in PGV-5 Scheme Using SIMON Algorithm☆

TL;DR: The result of this research is plaintext that meets the characteristics of fixed point that does not affect the plaintext hash value because the resulting output is the used IV value itself.

TL;DR: In this article , the authors improved the sponge structure of SAEAES by introducing the MD (Merkle Damgard) iterative structure, which improved the ability to resist collision attacks, fixed point attacks and cluster attacks.

TL;DR: Desain modifikasi skema hash function MDC-2 berbasis PRESENT dan analisis terhadap preimage resistance dan second preimage resistance menunjukkan bahwa DOPE dapat memenuhi properti one-wayness dan tidak ditemukan kolisi pada implementasi kedua serangan tersebut.

TL;DR: The performance of Secure Data is approved through simulations in terms of energy cost, computation time, etc., of the proposed algorithms and the outcomes demonstrate that Secure Data can be efficient while applying for ensuring security chances in IoT-based healthcare systems.

TL;DR: In this paper, a general model for hash functions based on block ciphers is presented, where the size of the hashcode is equal to the block length of the block cipher and the key size is approximately equal to block length.

TL;DR: 64 possible schemes exist, and it is shown that 12 of these are secure; they can be reduced to 2 classes based on linear transformations of variables and a new attack is presented on a scheme suggested by R. Merkle.

TL;DR: In this article, the authors proposed a block ciphers based hash function called PRESENT, which is the smallest published hash function with a digest size greater than or equal to 160 bits.

TL;DR: The author's research focused on the development of a novel and scalable approach to solving the Birthday Attacks on Hash Functions problem, which had previously been the focus of much of the criticism of previous approaches to this problem.