Difference between revisions of "HAS-V"

From The ECRYPT Hash Function Website
 
(Specification)
Line 5: Line 5:
 
* 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>
 +
@inproceedings{sacryptParkHL00,
 +
  author    = {Nan Kyoung Park and Joon Ho Hwang and Pil Joong Lee},
 +
  title    = {HAS-V: A New Hash Function with Variable Output Length},
 +
  booktitle = {Selected Areas in Cryptography},
 +
  year      = {2000},
 +
  pages    = {202-216},
 +
  url        = {http://link.springer.de/link/service/series/0558/bibs/2012/20120202.htm},
 +
  editor    = {Douglas R. Stinson and Stafford E. Tavares},
 +
  publisher = {Springer},
 +
  series    = {LNCS},
 +
  volume    = {2012},
 +
  isbn      = {3-540-42069-X},
 +
  abstract  = {Hash functions play an essential role in many areas of cryptographic applications such as digital signature, authentication, and key derivation. In this paper, we propose a new hash function with variable output length, namely HAS-V, to meet the needs of various security levels desired among different applications. A great deal of attention was paid to balance the characteristics of security and performance. The use of message expansion, 4-variable Boolean functions, variable and fixed amounts of shifts, and interrelated parallel lines provide a high level of security for HAS-V. Experiments show that HAS-V is about 19% faster than SHA-1, 31% faster than RIPEMD-160, and 26% faster than HAVAL on a Pentium PC.},
 +
}
 +
</bibtex>
 
-->
 
-->
  

Revision as of 07:42, 11 March 2008

1 Specification

2 Cryptanalysis

2.1 Best Known Results


2.2 Generic Attacks


2.3 Collision Attacks


2.4 Second Preimage Attacks


2.5 Preimage Attacks


2.6 Others