Implementation of Efficient Operations over GF(232) Using Graphics Processing Units - Information and Communication Technology Access content directly
Conference Papers Year : 2014

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.
Fichier principal
Vignette du fichier
978-3-642-55032-4_62_Chapter.pdf (154 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01397276 , version 1 (15-11-2016)

Licence

Attribution

Identifiers

Cite

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⟩
53 View
75 Download

Altmetric

Share

Gmail Facebook X LinkedIn More