PKC-HASH - Revision history

Crechberger at 08:47, 12 March 2008

2008-03-12T08:47:37Z

Fmendel: /* Best Known Results */

2008-03-11T16:14:49Z

‎Best Known Results

Fmendel: /* Best Known Results */

2008-03-11T13:13:12Z

‎Best Known Results

Fmendel: /* Collision Attacks */

2008-03-11T13:12:12Z

‎Collision Attacks

Fmendel: /* Collision Attacks */

2008-03-11T07:21:06Z

‎Collision Attacks

Npramstaller: /* Collision Attacks */

2008-03-11T05:25:55Z

‎Collision Attacks

Tnad: /* Collision Attacks */

2008-03-10T18:02:41Z

‎Collision Attacks

Fmendel: /* Specification */

2008-03-10T16:09:56Z

‎Specification

Fmendel: /* Specification */

2008-03-10T15:58:50Z

‎Specification

Fmendel at 15:58, 10 March 2008

2008-03-10T15:58:04Z

New page

== Specification ==



== Cryptanalysis ==

=== Best Known Results ===

----

=== Generic Attacks ===
* [[GenericAttacksMerkleDamgaard| Generic Attacks on the Merkle-Damgaard Construction ]]

----

=== Collision Attacks ===

----

=== Second Preimage Attacks ===

----

=== Preimage Attacks ===

----

=== Others ===

@@ Line 27: / Line 27: @@
 === Best Known Results ===
-The best collision attack on full PKC-hash was published by Mendel et al. It has complexity of 2<sup>20.5</sup> hash evaluations.
+The best collision attack on full PKC-hash was published by Mendel et al. It has complexity of 2<sup>20.5</sup> hash evaluations. The are no preimage or 2nd preimage attacks known.
 ----

@@ Line 27: / Line 27: @@
 === Best Known Results ===
-The best collision attack on full PKC-hash was published by Wang et al. It has complexity of 2<sup>20.5</sup> hash evaluations.
+The best collision attack on full PKC-hash was published by Mendel et al. It has complexity of 2<sup>20.5</sup> hash evaluations.
 ----

← Older revision		Revision as of 13:13, 11 March 2008
Line 27:		Line 27:

	=== Best Known Results ===		=== Best Known Results ===
		+	The best collision attack on full PKC-hash was published by Wang et al. It has complexity of 2<sup>20.5</sup> hash evaluations.

	----		----

← Older revision		Revision as of 13:12, 11 March 2008
Line 36:		Line 36:

	=== Collision Attacks ===		=== Collision Attacks ===
		+
		+	<bibtex>
		+	@inproceedings{iciscMendelPR06,
		+	author = {Florian Mendel and Norbert Pramstaller and Christian Rechberger},
		+	title = {Improved Collision Attack on the Hash Function Proposed at PKC'98},
		+	booktitle = {ICISC},
		+	year = {2006},
		+	pages = {8-21},
		+	url = {http://dx.doi.org/10.1007/11927587_3},
		+	editor = {Min Surp Rhee and Byoungcheon Lee},
		+	publisher = {Springer},
		+	series = {LNCS},
		+	volume = {4296},
		+	isbn = {3-540-49112-0},
		+	abstract = {n this article, we present an improved collision attack on the hash function proposed by Shin et al. at PKC’98. The attack has a complexity of about 2^{20.5} hash computations, while the previous attack of Chang et al. presented at SAC 2002 has a complexity of about 2^{37.13} hash computations. In the analysis of the hash function we combined existing approaches with recent results in cryptanalysis of hash functions. We show that message-dependent rotations can be exploited to construct collisions. The weak design of the step function facilitates high-probability multi-block collisions.},
		+	}
		+	</bibtex>

	<bibtex>		<bibtex>

@@ Line 53: / Line 53: @@
+}
 </bibtex>
 <bibtex>

@@ Line 36: / Line 36: @@
 === Collision Attacks ===
 <bibtex>
 @inproceedings{fseHanPC02,

@@ Line 9: / Line 9: @@
 @inproceedings{pkcShinRRL98,
    author    = {Sang Uk Shin and Kyung Hyune Rhee and Dae-Hyun Ryu and Sangjin Lee},
-   title     = {{A New Hash Function Based on MDx-Family and Its Application to MAC}},
+   title     = {A New Hash Function Based on MDx-Family and Its Application to MAC},
    pages     = {234-246},
    url        = {http://link.springer.de/link/service/series/0558/bibs/1431/14310234.htm},

@@ Line 1: / Line 1: @@
 == Specification ==
 * digest size: 160 bits
 * max. message length: < 2<sup>64</sup> bits
 * compression function: 512-bit message block, 160-bit chaining variable
 * Specification:
 -->
 == Cryptanalysis ==