Presentation	2015-03-02 Arithmetic in a Prime Field of SWIFFT/SWIFFTX Hidenori KUWAKADO,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	SWIFFT is a hash (compression) function based on the infeasibility of lattice problems. The preimage resistance and the collision resistance of SWIFFT is at least as hard as finding short vectors in ideal lattices. Since SWIFFT is linear, it cannot be used for cryptographic applications. SWIFFTX is a cryptographic hash function that uses SWIFFT as a primitive. The security and the efficiency of SWIFFTX mainly depend on those of SWIFFT. SWIFFT is considered as the improvement of the Ajtai-GGH hash function by using the fast Fourier transform and skew-circulant matrices. Our experiments show that SWIFFT is 8-15 times as fast as the Ajtai-GGH hash function. The security of SWIFFT depends on the size of parameters. We show possible parameters for increasing the security of SWIFFT.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	SWIFFT / SWIFFTX / FFT / skew-circulant matrix / finite field
Paper #	IT2014-85,ISEC2014-98,WBS2014-77
Date of Issue

Conference Information
Committee	WBS
Conference Date	2015/2/23(1days)
Place (in Japanese)	(See Japanese page)
Place (in English)
Topics (in Japanese)	(See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To	Wideband System(WBS)
Language	ENG
Title (in Japanese)	(See Japanese page)
Sub Title (in Japanese)	(See Japanese page)
Title (in English)	Arithmetic in a Prime Field of SWIFFT/SWIFFTX
Sub Title (in English)
Keyword(1)	SWIFFT
Keyword(2)	SWIFFTX
Keyword(3)	FFT
Keyword(4)	skew-circulant matrix
Keyword(5)	finite field
1st Author's Name	Hidenori KUWAKADO
1st Author's Affiliation	Faculty of Informatics Kansai University()
Date	2015-03-02
Paper #	IT2014-85,ISEC2014-98,WBS2014-77
Volume (vol)	vol.114
Number (no)	472
Page	pp.pp.-
#Pages	4
Date of Issue