Turn it on in Settings › Safari to view this website.
This message will be pushed to the admin's iPhone instantly.
The Third SHA-3 Candidate Conference will be held in the Metropolitan Washington Area on March 22-23, 2012, following FSE 2012.
NIST announced the name of the SHA-3 candidates accepted for the final round. Shabal is not selected… We wait for the NIST report on the selection of the SHA-3 finalists.
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 …
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.
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 …
We show the ﬁrst indiﬀerentiability 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 …
In this paper, we focus on an optimized implementation of the Shabal candidate. We improve the state-of-the-art using the unfolding method.
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.
Two papers are about Shabal :
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).
All content Copyright Shabal
Powered by WordPress + WPtouch 1.9.34