Difference between revisions of "Snefru-n"
From The ECRYPT Hash Function Website
(→Spezification) |
(→Specification) |
||
| Line 1: | Line 1: | ||
== Specification == | == Specification == | ||
| − | + | <!-- | |
* digest size: 160 bits | * digest size: 160 bits | ||
* max. message length: < 2<sup>64</sup> bits | * max. message length: < 2<sup>64</sup> bits | ||
* compression function: 512-bit message block, 160-bit chaining variable | * compression function: 512-bit message block, 160-bit chaining variable | ||
* Specification: | * Specification: | ||
| + | --> | ||
<bibtex> | <bibtex> | ||
| − | @article{ | + | @article{jocMerkle90, |
author = {Ralph C. Merkle}, | author = {Ralph C. Merkle}, | ||
title = {{A Fast Software One-Way Hash Function}}, | title = {{A Fast Software One-Way Hash Function}}, | ||
| Line 16: | Line 17: | ||
year = {1990}, | year = {1990}, | ||
pages = {43-58}, | pages = {43-58}, | ||
| − | + | url = {http://dx.doi.org/10.1007/BF00203968}, | |
| − | abstract = {}, | + | abstract = {One way hash functions are an important cryptographic primitive, and can be used to solve a wide variety of problems involving authentication and integrity. It would be useful to adopt a standard one-way hash function for use in a wide variety of systems throughout the world. Such a standard one-way hash function should be easy to implement, use, and understand; resistant to cryptographic attack, and should be fast when implemented in software. We present a candidate one-way hash function which appears to have these desirable properties. Further analysis of its cryptographic security is required before it can be considered for widespread use.}, |
} | } | ||
</bibtex> | </bibtex> | ||
Revision as of 18:01, 10 March 2008
Contents
1 Specification
Ralph C. Merkle - {A Fast Software One-Way Hash Function}
- J. Cryptology 3(1):43-58,1990
- http://dx.doi.org/10.1007/BF00203968
BibtexAuthor : Ralph C. Merkle
Title : {A Fast Software One-Way Hash Function}
In : J. Cryptology -
Address :
Date : 1990
