Matches in DBpedia 2016-04 for { ?s ?p "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 264, defined by extended Feistel networks."@en }
Showing triples 1 to 2 of
2
with 100 triples per page.
- NaSHA comment "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 264, defined by extended Feistel networks.".
- Q6956354 comment "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 264, defined by extended Feistel networks.".