Presentation	2000/1/25 The hash function using the multi-affine key system Shuichi Suzuki,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	The multi-affine key system is defined by the several affine keys and the interaction between those keys. Using a part of the pseudo random numbers generated by this system, we can define a stream cipher, which we call the multi-affine key cipher. Each affine key has the life time, and an old affine key is rewritten by the interaction of affine keys. By this idea, our cipher is very safe and high speed. Using the algorithm of multi-affine key system, we can construct a high speed hash function. On a personal computer of Pentium II 450MHZ, using a Borland Delphi 5.0, our cipher is able to encrypt at the speed of 225 mega bits per second, and our hash function by a multi-affine key can generate the hash table of any bytes at the speed of 715 mega bits per second.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	symmetric key cipher / multi-affine key system / stream cipher / random number / hash function
Paper #	ISEC99-79
Date of Issue

Conference Information
Committee	ISEC
Conference Date	2000/1/25(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	Information Security (ISEC)
Language	JPN
Title (in Japanese)	(See Japanese page)
Sub Title (in Japanese)	(See Japanese page)
Title (in English)	The hash function using the multi-affine key system
Sub Title (in English)
Keyword(1)	symmetric key cipher
Keyword(2)	multi-affine key system
Keyword(3)	stream cipher
Keyword(4)	random number
Keyword(5)	hash function
1st Author's Name	Shuichi Suzuki
1st Author's Affiliation	Tokyo Denki University()
Date	2000/1/25
Paper #	ISEC99-79
Volume (vol)	vol.99
Number (no)	584
Page	pp.pp.-
#Pages	6
Date of Issue