Implementation of Efficient Operations over GF(232) Using Graphics Processing Units

Abstract : Evaluating non-linear multivariate polynomial systems over finite fields is an important subroutine, e.g., for encryption and signature verification in multivariate public-key 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(232) via their implementations on graphics processing units.
Complete list of metadatas

Cited literature [5 references]  Display  Hide  Download

https://hal.inria.fr/hal-01397276
Contributor : Hal Ifip <>
Submitted on : Tuesday, November 15, 2016 - 4:07:00 PM
Last modification on : Wednesday, November 16, 2016 - 1:04:11 AM
Long-term archiving on : Thursday, March 16, 2017 - 5:45:00 PM

File

978-3-642-55032-4_62_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Satoshi Tanaka, Takanori Yasuda, Kouichi Sakurai. Implementation of Efficient Operations over GF(232) Using Graphics Processing Units. 2nd Information and Communication Technology - EurAsia Conference (ICT-EurAsia), Apr 2014, Bali, Indonesia. pp.602-611, ⟨10.1007/978-3-642-55032-4_62⟩. ⟨hal-01397276⟩

Share

Metrics

Record views

67

Files downloads

104