NaSHA

NaSHA is a hash function accepted as a first round SHA-3 candidate for the NIST hash function competition.

NaSHA was designed by Smile Markovski and Aleksandra Mileva with contributions by Simona Samardziski (programmer) and Boro Jakimovski (programmer). NaSHA supports internal state sizes of 1024 and 2048 bits, and arbitrary output sizes between 125 and 512 bits. It uses quasigroup string transformations with quasigroups of order 2⁶⁴, defined by extended Feistel networks.^[1] The quasigroups used in every iteration of the compression function are different and depend on the processed message block.

The authors claim performance of up to 23.06 cycles per byte on an Intel Core 2 Duo in 64-bit mode.

Cryptanalysis during the SHA-3 competition has indicated that 384/512 version of NaSHA is susceptible to collision attacks,^[2] but the authors disputed those attacks and also included small changes to achieve the strength of 224/256 version.

References

↑ S. Markovski, A. Mileva. "Generating huge quasigroups from small non-linear bijections via extended Feistel function". In Quasigroups and Related Systems, vol. 17, 2009, pp. 91-106.
↑ "NaSHA". The SHA-3 Zoo. Retrieved July 7, 2009.

External links

Cryptographic hash functions and message authentication codes
List Comparison Known attacks
Common functions	MD5 (compromised) SHA-1 (compromised) SHA-2 SHA-3 BLAKE2
SHA-3 finalists	BLAKE Grøstl JH Skein Keccak (winner)
Other functions	BLAKE3 CubeHash ECOH FSB Fugue GOST HAS-160 HAVAL Kupyna LSH Lane MASH-1 MASH-2 MD2 MD4 MD6 MDC-2 N-hash RIPEMD RadioGatún SIMD SM3 SWIFFT Shabal Snefru Streebog Tiger VSH Whirlpool
Password hashing/ key stretching functions	Argon2 Balloon bcrypt Catena crypt LM hash Lyra2 Makwa PBKDF2 scrypt yescrypt
General purpose key derivation functions	HKDF KDF1/KDF2
MAC functions	CBC-MAC DAA GMAC HMAC NMAC OMAC/CMAC PMAC Poly1305 SipHash UMAC VMAC
Authenticated encryption modes	CCM ChaCha20-Poly1305 CWC EAX GCM IAPM OCB
Attacks	Collision attack Preimage attack Birthday attack Brute-force attack Rainbow table Side-channel attack Length extension attack
Design	Avalanche effect Hash collision Merkle–Damgård construction Sponge function HAIFA construction
Standardization	CAESAR Competition CRYPTREC NESSIE NIST hash function competition Password Hashing Competition
Utilization	Hash-based cryptography Merkle tree Message authentication Proof of work Salt Pepper

Cryptography
General	History of cryptography Outline of cryptography Cryptographic protocol Authentication protocol Cryptographic primitive Cryptanalysis Cryptocurrency Cryptosystem Cryptographic nonce Cryptovirology Hash function Cryptographic hash function Key derivation function Digital signature Kleptography Key (cryptography) Key exchange Key generator Key schedule Key stretching Keygen Cryptojacking malware Ransomware Random number generation Cryptographically secure pseudorandom number generator (CSPRNG) Pseudorandom noise (PRN) Secure channel Insecure channel Subliminal channel Encryption Decryption End-to-end encryption Harvest now, decrypt later Information-theoretic security Plaintext Codetext Ciphertext Shared secret Trapdoor function Trusted timestamping Key-based routing Onion routing Garlic routing Kademlia Mix network
Mathematics	Cryptographic hash function Block cipher Stream cipher Symmetric-key algorithm Authenticated encryption Public-key cryptography Quantum key distribution Quantum cryptography Post-quantum cryptography Message authentication code Random numbers Steganography
Category

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.