SWIFFT

From The ECRYPT Hash Function Website

Jump to: navigation, search

Contents

1 Specification

  • digest size: 512 bits
  • max. message length: < 264 bits
  • Specification:

Vadim Lyubashevsky, Daniele Micciancio, Chris Peikert, Alon Rosen - SWIFFT: A Modest Proposal for FFT Hashing
In Proceedings of FSE, LNCS 5086, pp. 54-72, Springer, 2008
[Electronic Edition] [Bibtex]
Author : Vadim Lyubashevsky, Daniele Micciancio, Chris Peikert, Alon Rosen
Title : SWIFFT: A Modest Proposal for FFT Hashing
In : In Proceedings of FSE -
[Abstract]

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

Johannes Buchmann, Richard Lindner - Secure Parameters for SWIFFT
Cryptology ePrint Archive, Report 2008/493, 2008
[Electronic Edition] [Bibtex]
Author : Johannes Buchmann, Richard Lindner
Title : Secure Parameters for SWIFFT
In : Cryptology ePrint Archive, Report 2008/493 -
[Abstract]
Personal tools