Efficient computing over GF(216) using graphics processing unit

Satoshi Tanaka, Takanori Yasuda, Bo Yin Yang, Chen Mou Cheng, Kouichi Sakurai

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

Evaluating non-linear multivariate polynomial systems over finite fields is an important subroutine, e.g., for encryption and signature verification in multivariate cryptography. The security of multivariate cryptography definitely becomes lower if a larger field is used instead of GF(2) given the same number of bits in the key. However, we still would like to use larger fields because multivariate cryptography tends to run faster at the same level of security if a larger field is used. In this paper, we compare the efficiency of several techniques for evaluating multivariate polynomial systems over GF(2 16) vi their implementations on graphics processing units.

Original languageEnglish
Title of host publicationProceedings - 7th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, IMIS 2013
Pages843-846
Number of pages4
DOIs
StatePublished - 2013
Externally publishedYes
Event7th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, IMIS 2013 - Taichung, Taiwan
Duration: 03 07 201305 07 2013

Publication series

NameProceedings - 7th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, IMIS 2013

Conference

Conference7th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, IMIS 2013
Country/TerritoryTaiwan
CityTaichung
Period03/07/1305/07/13

Keywords

  • Efficient Implementation
  • GPGPU
  • Multivariate cryptography
  • extension field

Fingerprint

Dive into the research topics of 'Efficient computing over GF(216) using graphics processing unit'. Together they form a unique fingerprint.

Cite this