About: NaSHA     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : dbo:Disease, within Data Space : dbpedia.org associated with source document(s)
QRcode icon
http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FNaSHA

NaSHA is a hash function accepted as a first round SHA-3 candidate for the NIST hash function competition. NaSHA was designed by 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 264, defined by extended Feistel networks. The quasigroups used in every iteration of the compression function are different and depend on the processed message block.

AttributesValues
rdf:type
rdfs:label
  • NaSHA (en)
rdfs:comment
  • NaSHA is a hash function accepted as a first round SHA-3 candidate for the NIST hash function competition. NaSHA was designed by 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 264, defined by extended Feistel networks. The quasigroups used in every iteration of the compression function are different and depend on the processed message block. (en)
foaf:homepage
dcterms:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
Link from a Wikipage to an external page
sameAs
dbp:wikiPageUsesTemplate
has abstract
  • NaSHA is a hash function accepted as a first round SHA-3 candidate for the NIST hash function competition. NaSHA was designed by 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 264, defined by extended Feistel networks. 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, but the authors disputed those attacks and also included small changes to achieve the strength of 224/256 version. (en)
gold:hypernym
prov:wasDerivedFrom
page length (characters) of wiki page
foaf:isPrimaryTopicOf
is Link from a Wikipage to another Wikipage of
is Wikipage redirect of
is Wikipage disambiguates of
is foaf:primaryTopic of
Faceted Search & Find service v1.17_git139 as of Feb 29 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (62 GB total memory, 52 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software