Compact Implementations of Shabal

Compact implementations of hash functions promote performance, by reducing pressure on L1 cache, and allow for easier integration on platforms with stringent constraints on code size. We present here some implementations of the Shabal hash function, optimized for code compactness. Two portable C implementations are provided, as well as specialized implementations in assembly for several architectures (32-bit and 64-bit x86, 32-bit PowerPC, big-endian and little-endian ARM, big-endian and little-endian 32-bit MIPS, and AVR8 microcontrollers). Read the rest of this entry »

Two optimized implementations for PowerPC platforms

We present here two optimized implementations for PowerPC platforms, in 32-bit and 64-bit modes. They offer a speed increase of about 30% over the optimized C implementation of Shabal. Read the rest of this entry »

Optimized implementations of Shabal

The optimized C implementation of Shabal provides a performance of about 7.5 cpb on an Intel Core2 processor in 64-bit mode, but only 9.3 cpb in 32-bit mode. We present here an implementation in assembly for i386, which achieves 7.5 cpb on an Intel Core2. This implementation is also quite shorter than the compiled C code (4813 bytes, including 2.8 kB for precomputed initial values for all 16 supported output sizes) and compatible with the complete i386 processor family. Read the rest of this entry »

Internal Distinguishers in Indifferentiable Hashing: The Shabal Case

We show the first indifferentiability proof of a hash construction C ^F which does not make the assumption that the inner primitive F is ideal, but allows the existence (up to certain bounds that we explicit) of statistical distinguishers on F. Read the rest of this entry »

Unfolding Method for Shabal on Virtex-5 FPGAs: Concrete Results

In this paper, we focus on an optimized implementation of the Shabal candidate. We improve the state-of-the-art using the unfolding method. Read the rest of this entry »

High-Speed Implementation of the SHA-3 Candidate Shabal

The presentation of Julien Francq and Céline Thuillet, “High-Speed Implementation of the SHA-3 Candidate Shabal” at CryptArchi 2010 is now available in the Download section. Read the rest of this entry »

The list of the accepted papers for the Second SHA-3 Candidate Conference is now available

Two papers are about Shabal : Read the rest of this entry »

SSE2-enhanced parallel implementations of the Shabal hash functions

This SSE2-enhanced parallel implementations of the Shabal hash functions runs up to four parallel instances of Shabal (on four input data messages of identical length). Read the rest of this entry »

“A Low-Area yet Performant FPGA Implementation of Shabal”

A new paper on FPGA implementation of Shabal is available on ePrint. The authors are Jérémie Detrey, Pierrick Gaudry, and Karim Khalfallah.

Abstract. In this paper, we present an efficient FPGA implementation of the SHA-3 hash function candidate Shabal. Read the rest of this entry »

A compact implementation of Shabal

A new very small implementation of the Shabal hash function in language  C is available in the Donwload Section.

Read the rest of this entry »