Difference between revisions of "PARSHA-256"
From The ECRYPT Hash Function Website
(→Specification) |
|||
| (2 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
| − | {{ | + | == Specification == |
| + | |||
| + | |||
| + | * digest size: 256 bits | ||
| + | <!--* max. message length: < 2<sup>64</sup> bits--> | ||
| + | * compression function: 512-bit message block, 256-bit chaining variable | ||
| + | * Specification: | ||
| + | |||
| + | <bibtex> | ||
| + | @inproceedings{fsePalS03, | ||
| + | author = {Pinakpani Pal and Palash Sarkar}, | ||
| + | title = {PARSHA-256- - A New Parallelizable Hash Function and a Multithreaded Implementation}, | ||
| + | pages = {347-361}, | ||
| + | url = {http://dx.doi.org/10.1007/b93938}, | ||
| + | editor = {Thomas Johansson}, | ||
| + | booktitle = {FSE}, | ||
| + | publisher = {Springer}, | ||
| + | series = {LNCS}, | ||
| + | volume = {2887}, | ||
| + | year = {2003}, | ||
| + | isbn = {3-540-20449-0}, | ||
| + | abstract = {In this paper, we design a new hash function PARSHA-256. PARSHA-256 uses the compression function of SHA-256 along with the Sarkar-Schellenberg composition principle. As a consequence, PARSHA-256 is collision resistant if the compression function of SHA-256 is collision resistant. On the other hand, PARSHA-256 can be implemented using a binary tree of processors, resulting in a significant speed-up over SHA-256. We also show that PARSHA-256 can be efficiently implemented through concurrent programming on a single processor machine using a multithreaded approach. Experimental results on P4 running Linux show that for long messages the multithreaded implementation is faster than SHA-256.}, | ||
| + | } | ||
| + | </bibtex> | ||
| + | |||
| + | == Cryptanalysis == | ||
| + | |||
| + | |||
| + | === Best Known Results === | ||
| + | |||
| + | ---- | ||
| + | |||
| + | === Generic Attacks === | ||
| + | * [[GenericAttacksMerkleDamgaard| Generic Attacks on the Merkle-Damgaard Construction ]] | ||
| + | |||
| + | ---- | ||
| + | |||
| + | === Collision Attacks === | ||
| + | |||
| + | ---- | ||
| + | |||
| + | === Second Preimage Attacks === | ||
| + | |||
| + | ---- | ||
| + | |||
| + | === Preimage Attacks === | ||
| + | |||
| + | |||
| + | ---- | ||
| + | |||
| + | === Others === | ||
Latest revision as of 20:37, 10 March 2008
Contents
1 Specification
- digest size: 256 bits
- compression function: 512-bit message block, 256-bit chaining variable
- Specification:
Pinakpani Pal, Palash Sarkar - PARSHA-256- - A New Parallelizable Hash Function and a Multithreaded Implementation
- FSE 2887:347-361,2003
- http://dx.doi.org/10.1007/b93938
BibtexAuthor : Pinakpani Pal, Palash Sarkar
Title : PARSHA-256- - A New Parallelizable Hash Function and a Multithreaded Implementation
In : FSE -
Address :
Date : 2003
