Markovski, Smile and Mileva, Aleksandra and Samardziska, Simona and Jakimovski, Boro (2009) NaSHA. In: First SHA-3 Candidate Conference, February 25-28, 2009, K.U. Leuven, Belgium. (Unpublished)
Preview |
Text
Part2B1.pdf Download (204kB) | Preview |
Official URL: http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/s...
Abstract
We propose the NaSHA-(m, k, r) family of cryptographic hash functions, based on quasigroup transformations. We use huge quasigroups defined by extended Feistel networks from small bijections and a novel design principle: the quasigroup used in every iteration of the compression function is different and depends on the processed message block. We present in all details of the implementations of NaSHA-(m, 2, 6) where m in {224, 256, 384, 512}.
| Item Type: | Conference or Workshop Item (Speech) |
|---|---|
| Additional Information: | First Round candidate for NIST SHA-3 cryptographic hash algorithm competition |
| Subjects: | Natural sciences > Computer and information sciences |
| Divisions: | Faculty of Computer Science |
| Depositing User: | Aleksandra Mileva |
| Date Deposited: | 31 Oct 2012 09:02 |
| Last Modified: | 19 Nov 2012 13:09 |
| URI: | https://eprints.ugd.edu.mk/id/eprint/105 |
Actions (login required)
 |
View Item |