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

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

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

1 被引用数 (Scopus)

抄録

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.

本文言語英語
ホスト出版物のタイトルProceedings - 2014 2nd International Symposium on Computing and Networking, CANDAR 2014
出版社Institute of Electrical and Electronics Engineers Inc.
ページ543-548
ページ数6
ISBN(電子版)9781479941520
DOI
出版ステータス出版済み - 2 27 2015
イベント2nd International Symposium on Computing and Networking, CANDAR 2014 - Shizuoka, 日本
継続期間: 12 10 201412 12 2014

出版物シリーズ

名前Proceedings - 2014 2nd International Symposium on Computing and Networking, CANDAR 2014

その他

その他2nd International Symposium on Computing and Networking, CANDAR 2014
国/地域日本
CityShizuoka
Period12/10/1412/12/14

All Science Journal Classification (ASJC) codes

  • コンピュータ ネットワークおよび通信

フィンガープリント

「Parallelization of QUAD stream cipher using linear recurring sequences on graphics processing units」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル