Efficient computing over GF(216) using graphics processing unit

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

doi:10.1109/IMIS.2013.151

Efficient computing over GF(2¹⁶) using graphics processing unit

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

Mathematical Informatics

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

2 Citations (Scopus)

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 ¹⁶) vi their implementations on graphics processing units.

Original language	English
Title of host publication	Proceedings - 7th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, IMIS 2013
Pages	843-846
Number of pages	4
DOIs	https://doi.org/10.1109/IMIS.2013.151
Publication status	Published - Oct 17 2013
Event	7th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, IMIS 2013 - Taichung, Taiwan, Province of China Duration: Jul 3 2013 → Jul 5 2013

Other

Other	7th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, IMIS 2013
Country	Taiwan, Province of China
City	Taichung
Period	7/3/13 → 7/5/13

All Science Journal Classification (ASJC) codes

Computer Networks and Communications

Access to Document

10.1109/IMIS.2013.151

Fingerprint Dive into the research topics of 'Efficient computing over GF(2<sup>16</sup>) using graphics processing unit'. Together they form a unique fingerprint.

Cite this

Tanaka, S., Yasuda, T., Yang, B. Y., Cheng, C. M., & Sakurai, K. (2013). Efficient computing over GF(2¹⁶) using graphics processing unit. In Proceedings - 7th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, IMIS 2013 (pp. 843-846). [6603790] https://doi.org/10.1109/IMIS.2013.151

Efficient computing over GF(2¹⁶) using graphics processing unit. / Tanaka, Satoshi; Yasuda, Takanori; Yang, Bo Yin; Cheng, Chen Mou; Sakurai, Kouichi.

Proceedings - 7th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, IMIS 2013. 2013. p. 843-846 6603790.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Tanaka, S, Yasuda, T, Yang, BY, Cheng, CM & Sakurai, K 2013, Efficient computing over GF(2¹⁶) using graphics processing unit. in Proceedings - 7th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, IMIS 2013., 6603790, pp. 843-846, 7th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, IMIS 2013, Taichung, Taiwan, Province of China, 7/3/13. https://doi.org/10.1109/IMIS.2013.151

@inproceedings{48e20e3ea7154356b88afc91ab2e6d3f,

title = "Efficient computing over GF(216) using graphics processing unit",

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.",

author = "Satoshi Tanaka and Takanori Yasuda and Yang, {Bo Yin} and Cheng, {Chen Mou} and Kouichi Sakurai",

year = "2013",

month = oct,

day = "17",

doi = "10.1109/IMIS.2013.151",

language = "English",

isbn = "9780769549743",

pages = "843--846",

booktitle = "Proceedings - 7th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, IMIS 2013",

note = "7th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, IMIS 2013 ; Conference date: 03-07-2013 Through 05-07-2013",

}

TY - GEN

T1 - Efficient computing over GF(216) using graphics processing unit

AU - Tanaka, Satoshi

AU - Yasuda, Takanori

AU - Yang, Bo Yin

AU - Cheng, Chen Mou

AU - Sakurai, Kouichi

PY - 2013/10/17

Y1 - 2013/10/17

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84885395228&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84885395228&partnerID=8YFLogxK

U2 - 10.1109/IMIS.2013.151

DO - 10.1109/IMIS.2013.151

M3 - Conference contribution

AN - SCOPUS:84885395228

SN - 9780769549743

SP - 843

EP - 846

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

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

Y2 - 3 July 2013 through 5 July 2013

ER -