Parallelization of QUAD stream cipher using linear recurring sequences on graphics processing units

Satoshi Tanaka, Chen Mou Cheng, Takanori Yasuda, Kouichi Sakurai

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Proposed by Berbain, Gilbert, and Patarin in Euro crypt 2006, QUAD is a provably secure stream cipher. The speed of QUAD depends on the computational cost of evaluating quadratic polynomials over finite fields. For QUAD with m quadratic polynomials in n unknowns over GF (q), this requires O (mn2) GF (q) additions and multiplications. Petzoldt is able to reduce the evaluation cost to O (mn) GF (q) additions and multiplications by using linear recurring sequences to generate the coefficients. In this work, we parallelize and optimize his algorithm for running on Graphics Processing Unit (GPU). The result shows that our GPU implementation of the parallelized algorithm has achieved the best performance in the literature.

Original languageEnglish
Title of host publicationProceedings - 2014 2nd International Symposium on Computing and Networking, CANDAR 2014
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages543-548
Number of pages6
ISBN (Electronic)9781479941520
DOIs
Publication statusPublished - Feb 27 2015
Event2nd International Symposium on Computing and Networking, CANDAR 2014 - Shizuoka, Japan
Duration: Dec 10 2014Dec 12 2014

Publication series

NameProceedings - 2014 2nd International Symposium on Computing and Networking, CANDAR 2014

Other

Other2nd International Symposium on Computing and Networking, CANDAR 2014
Country/TerritoryJapan
CityShizuoka
Period12/10/1412/12/14

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'Parallelization of QUAD stream cipher using linear recurring sequences on graphics processing units'. Together they form a unique fingerprint.

Cite this