SWIFFT - Revision history

Fmendel: /* Others */

2008-12-02T07:32:14Z

‎Others

Fmendel: /* Others */

2008-12-02T07:31:29Z

‎Others

Fmendel: /* Specification */

2008-11-10T09:29:10Z

‎Specification

Fmendel at 09:26, 10 November 2008

2008-11-10T09:26:24Z

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 58: / Line 58: @@
      howpublished = {Cryptology ePrint Archive, Report 2008/493},
      year = {2008},
-     note = {\url{http://eprint.iacr.org/}},
+     url= {http://eprint.iacr.org/2008/493},
      abstract = {The SWIFFT compression functions, proposed by Lyubashevsky et al. at FSE 2008, are very efficient instantiations of generalized compact knapsacks. They have the unique property, that asymptotically fi�nding collisions for a random compression function implies being able to solve the worst case of computationally hard lattice problems. We present two results. First, we show that the scheme works equally efficient, when the main security parameter n is the predecessor of a prime instead of a power of two. Then, we present parameter generation algorithms for both cases. Second, we give experimental evidence that fi�nding pseudo-collisions for SWIFFT, is as hard as breaking a 87-bit symmetric cipher according to Lenstra's predictions. We then suggest conservative parameters, corresponding to 100-bit security.},
+}
 </bibtex>

← Older revision		Revision as of 07:31, 2 December 2008
Line 51:		Line 51:

	=== Others ===		=== Others ===
		+
		+	<bibtex>
		+	@misc{cryptoeprint:2008:493,
		+	author = {Johannes Buchmann and Richard Lindner},
		+	title = {Secure Parameters for SWIFFT},
		+	howpublished = {Cryptology ePrint Archive, Report 2008/493},
		+	year = {2008},
		+	note = {\url{http://eprint.iacr.org/}},
		+	abstract = {The SWIFFT compression functions, proposed by Lyubashevsky et al. at FSE 2008, are very efficient instantiations of generalized compact knapsacks. They have the unique property, that asymptotically fi�nding collisions for a random compression function implies being able to solve the worst case of computationally hard lattice problems. We present two results. First, we show that the scheme works equally efficient, when the main security parameter n is the predecessor of a prime instead of a power of two. Then, we present parameter generation algorithms for both cases. Second, we give experimental evidence that fi�nding pseudo-collisions for SWIFFT, is as hard as breaking a 87-bit symmetric cipher according to Lenstra's predictions. We then suggest conservative parameters, corresponding to 100-bit security.},
		+	}
		+	</bibtex>

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