Efficient implementation for QUAD stream cipher with GPUs

Satoshi Tanaka, Takashi Nishide, Kouichi Sakurai

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

QUAD stream cipher uses multivariate polynomial systems. It has provable security based on the computational hardness assumption. More specifically, the security of QUAD depends on hardness of solving non-linear multivariate systems over a finite field, and it is known as an NP-complete problem. However, QUAD is slower than other stream ciphers, and an efficient implementation, which has a reduced computational cost, is required. In this paper, we propose an efficient implementation of computing multivariate polynomial systems for multivariate cryptography on GPU and evaluate efficiency of the proposal. GPU is considered to be a commodity parallel arithmetic unit. Moreover, we give an evaluation of our proposal. Our proposal parallelizes an algorithm of multivariate cryptography, and makes it efficient by optimizing the algorithm with GPU.

Original languageEnglish
Pages (from-to)897-911
Number of pages15
JournalComputer Science and Information Systems
Volume10
Issue number2 SPL
DOIs
Publication statusPublished - Apr 1 2013

Fingerprint

Cryptography
Hardness
Polynomials
Computational complexity
Graphics processing unit
Costs

All Science Journal Classification (ASJC) codes

  • Computer Science(all)

Cite this

Efficient implementation for QUAD stream cipher with GPUs. / Tanaka, Satoshi; Nishide, Takashi; Sakurai, Kouichi.

In: Computer Science and Information Systems, Vol. 10, No. 2 SPL, 01.04.2013, p. 897-911.

Research output: Contribution to journalArticle

Tanaka, Satoshi ; Nishide, Takashi ; Sakurai, Kouichi. / Efficient implementation for QUAD stream cipher with GPUs. In: Computer Science and Information Systems. 2013 ; Vol. 10, No. 2 SPL. pp. 897-911.
@article{9bca48703db34266a111f028bac75d65,
title = "Efficient implementation for QUAD stream cipher with GPUs",
abstract = "QUAD stream cipher uses multivariate polynomial systems. It has provable security based on the computational hardness assumption. More specifically, the security of QUAD depends on hardness of solving non-linear multivariate systems over a finite field, and it is known as an NP-complete problem. However, QUAD is slower than other stream ciphers, and an efficient implementation, which has a reduced computational cost, is required. In this paper, we propose an efficient implementation of computing multivariate polynomial systems for multivariate cryptography on GPU and evaluate efficiency of the proposal. GPU is considered to be a commodity parallel arithmetic unit. Moreover, we give an evaluation of our proposal. Our proposal parallelizes an algorithm of multivariate cryptography, and makes it efficient by optimizing the algorithm with GPU.",
author = "Satoshi Tanaka and Takashi Nishide and Kouichi Sakurai",
year = "2013",
month = "4",
day = "1",
doi = "10.2298/CSIS121102040T",
language = "English",
volume = "10",
pages = "897--911",
journal = "Computer Science and Information Systems",
issn = "1820-0214",
publisher = "ComSIS Consortium",
number = "2 SPL",

}

TY - JOUR

T1 - Efficient implementation for QUAD stream cipher with GPUs

AU - Tanaka, Satoshi

AU - Nishide, Takashi

AU - Sakurai, Kouichi

PY - 2013/4/1

Y1 - 2013/4/1

N2 - QUAD stream cipher uses multivariate polynomial systems. It has provable security based on the computational hardness assumption. More specifically, the security of QUAD depends on hardness of solving non-linear multivariate systems over a finite field, and it is known as an NP-complete problem. However, QUAD is slower than other stream ciphers, and an efficient implementation, which has a reduced computational cost, is required. In this paper, we propose an efficient implementation of computing multivariate polynomial systems for multivariate cryptography on GPU and evaluate efficiency of the proposal. GPU is considered to be a commodity parallel arithmetic unit. Moreover, we give an evaluation of our proposal. Our proposal parallelizes an algorithm of multivariate cryptography, and makes it efficient by optimizing the algorithm with GPU.

AB - QUAD stream cipher uses multivariate polynomial systems. It has provable security based on the computational hardness assumption. More specifically, the security of QUAD depends on hardness of solving non-linear multivariate systems over a finite field, and it is known as an NP-complete problem. However, QUAD is slower than other stream ciphers, and an efficient implementation, which has a reduced computational cost, is required. In this paper, we propose an efficient implementation of computing multivariate polynomial systems for multivariate cryptography on GPU and evaluate efficiency of the proposal. GPU is considered to be a commodity parallel arithmetic unit. Moreover, we give an evaluation of our proposal. Our proposal parallelizes an algorithm of multivariate cryptography, and makes it efficient by optimizing the algorithm with GPU.

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

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

U2 - 10.2298/CSIS121102040T

DO - 10.2298/CSIS121102040T

M3 - Article

AN - SCOPUS:84878135913

VL - 10

SP - 897

EP - 911

JO - Computer Science and Information Systems

JF - Computer Science and Information Systems

SN - 1820-0214

IS - 2 SPL

ER -