Presentation 2011-05-13
Fast Implementation and Experimentation of Multivariate Polynomial Cryptosystems on GPU
Satoshi TANAKA, Kouichi SAKURAI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In this paper, we try to fast implementation of QUAD and SPELT. They are stream ciphers with multivariate polynomial (MP) systems. QUADs use multivariate quadratic (MQ) systems, and SPELTs use sparse MP (SMP) system more than degree 2. However, QUAD and SPELT are shown that they have high securities with mathematical problems, called MP or MQ problem, they have the disadvantage of high cost of computation and memory cost especially QUAD. Our motivation is acceleration of stream ciphers, which have high securities with MP problem.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) stream cipher / fast implementation / Multivariate Polynomial Problem / GPGPU
Paper # ISEC2011-3
Date of Issue

Conference Information
Committee ISEC
Conference Date 2011/5/6(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) Fast Implementation and Experimentation of Multivariate Polynomial Cryptosystems on GPU
Sub Title (in English)
Keyword(1) stream cipher
Keyword(2) fast implementation
Keyword(3) Multivariate Polynomial Problem
Keyword(4) GPGPU
1st Author's Name Satoshi TANAKA
1st Author's Affiliation Graduate School and Faculty of Information Science and Electrical Engineering, Kyushu University()
2nd Author's Name Kouichi SAKURAI
2nd Author's Affiliation Theoretical Computer Science Group Dept of Computer Science and Communication Engineering, Kyushu University
Date 2011-05-13
Paper # ISEC2011-3
Volume (vol) vol.111
Number (no) 34
Page pp.pp.-
#Pages 6
Date of Issue