Back to Results
First PageMeta Content
Mathematical analysis / SWIFFT / Fast Fourier transform / Universal hashing / Fourier transform / SHA-2 / Vector space / Random oracle / Hash function / Cryptographic hash functions / Mathematics / Algebra


SWIFFT: A Modest Proposal for FFT Hashing Vadim Lyubashevsky1 , Daniele Micciancio1 , Chris Peikert2, , and Alon Rosen3 1
Add to Reading List

Document Date: 2009-08-17 12:04:34


Open Document

File Size: 205,62 KB

Share Result on Facebook

Company

IBM / Motorola / Intel / IDC / /

Facility

University of California / /

IndustryTerm

polynomial products / cryptographic and non-cryptographic applications / scalar products / multicore processors / level algorithm / certain other applications / software implementation / cryptographic applications / highlevel algorithm / software implementations / /

OperatingSystem

Linux / /

Organization

National Science Foundation / University of California at San Diego / /

Position

author / /

ProvinceOrState

California / /

Technology

encryption / cryptography / high-level algorithm / highlevel algorithm / multicore processors / public key / FFT algorithm / FFT-based algorithm / Linux / time algorithm / /

SocialTag