2014 Second International Symposium on Computing and Networking (CANDAR) (2014)
Dec. 10, 2014 to Dec. 12, 2014
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.
Polynomials, Graphics processing units, Ciphers, Generators, Data structures
S. Tanaka, C. Cheng, T. Yasuda and K. Sakurai, "Parallelization of QUAD Stream Cipher Using Linear Recurring Sequences on Graphics Processing Units," 2014 Second International Symposium on Computing and Networking (CANDAR), Shizuoka, Japan, 2014, pp. 543-548.