SARMAL
| News: |
09/12/2010: Nist announced the third round candidates. The last five algorithms become BLAKE, Grøstl, JH, Keccak, and Skein. Details are in the following website.
24/07/2009: Nist announced the second round candidates of SHA-3 competition. The last fourteen algorithms can be seen from their website.
17/04/2009: Non-randomness of the compression function of Sarmal is analysed by Mouha, Bjørstad and Preneel. It can be downloaded from here.
26/03/2009: Performance results of Sarmal are available on eBASH website .
22/02/2009: Slides for the First SHA-3 Conferance are now available here .
22/02/2009: A preimage and collision attack on Sarmal with different salt is presented by F. Mendel and M. Schläffer. It can be downloaded from here.
11/12/2008: Sarmal is one of the 51 NIST Round 1 Candidates.
21/11/2008:Additional Implementation is added. Additional implementation covers 64-bit assembly implementation of Sarmal on gcc compiler. The supporting document and source code can be found here.
21/11/2008: A preimage attack on Sarmal-512 that requires max(2^{512-s}, 2^{256+s}) time and 2^s memory complexity is presented by I. Nikolic and can be downloaded from here.
21/11/2008: A preimage attack on Sarmal-512 that requires max(2^{512-s}, 2^{256+s}) computation and 2^s memory is presented by I. Nikolic and can be downloaded from here.
| Folders: |
| Additional Implementation |
| KAT MCT |
| Optimized 32bit |
| Optimized 64bit |
| Reference Implementation |
| Supporting Document |
| Submission Package: |
The complete NIST submission package can also be downloaded from here.
| Analysis: |
17/04/2009:N. Mouha, T. Bjørstad, B. Preneel, Non-randomness in the Sarmal Compression Function.
19/12/2008: F. Mendel and M. Schläffer, Collisions and Preimages for Sarmal.
21/11/2008: I. Nikolic, Preimage attack on Sarmal-512.