Abstract
Evaluating non-linear multivariate polynomial systems over finite fields is an important subroutine, e.g., for encryption and signature verification in multivariate 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(2 16) vi their implementations on graphics processing units.
Original language | English |
---|---|
Title of host publication | Proceedings - 7th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, IMIS 2013 |
Pages | 843-846 |
Number of pages | 4 |
DOIs | |
Publication status | Published - Oct 17 2013 |
Event | 7th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, IMIS 2013 - Taichung, Taiwan, Province of China Duration: Jul 3 2013 → Jul 5 2013 |
Other
Other | 7th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, IMIS 2013 |
---|---|
Country/Territory | Taiwan, Province of China |
City | Taichung |
Period | 7/3/13 → 7/5/13 |
All Science Journal Classification (ASJC) codes
- Computer Networks and Communications