Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: preimage attack

Sortuj według:

Ogranicz wyniki do:

Improving security of lightweith SHA-3 against preimage attacks

Serhii O., Kotulski Z.

International Journal of Electronics and Telecommunications

2018

Vol. 64, No. 2

159--166

In this article we describe the SHA-3 algorithm and its internal permutation in which potential weaknesses are hidden. The hash algorithm can be used for different purposes, such as pseudo-random bit sequences generator, key wrapping or one pass authentication, especially in weak devices (WSN, IoT, etc.). Analysis of the function showed that successful preimage attacks are possible for low round hashes, protection from which only works with increasing the number of rounds inside the function. When the hash function is used for building lightweight applications, it is necessary to apply a small number of rounds, which requires additional security measures. This article proposes a variant improved hash function protecting against preimage attacks, which occur on SHA-3. We suggest using an additional external randomness sources obtained from a lightweight PRNG or from application of the source data permutation.

Cryptanalysis of the FSR-255 hash function

Kontak M., Szmidt J.

Control and Cybernetics

2014

Vol. 43, no. 2

365--374

In this paper we analyse the security of the FSR-255 cryptographic hash function. As a result of our security analysis we present preimage and second-preimage attacks. The attacks base on practical reversibility of the compression function. The complexity of preimage attack is about 211 evaluations of the compression function. The second-preimage attack has the complexity equivalent to one time evaluation of the compression function. Both of the attacks have been practically realised.