### 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(2^{32}) via their implementations on graphics processing units.

Original language | English |
---|---|

Title of host publication | Information and Communication Technology - Second IFIP TC5/8 International Conference, ICT-EurAsia 2014, Proceedings |

Publisher | Springer Verlag |

Pages | 602-611 |

Number of pages | 10 |

ISBN (Print) | 9783642550317 |

DOIs | |

Publication status | Published - Jan 1 2014 |

Event | 2nd IFIP TC5/8 International Conference on Information and Communication Technology, ICT-EurAsia 2014 - Bali, Indonesia Duration: Apr 14 2014 → Apr 17 2014 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 8407 LNCS |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Other

Other | 2nd IFIP TC5/8 International Conference on Information and Communication Technology, ICT-EurAsia 2014 |
---|---|

Country | Indonesia |

City | Bali |

Period | 4/14/14 → 4/17/14 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Computer Science(all)

### Cite this

^{32}) using graphics processing units. In

*Information and Communication Technology - Second IFIP TC5/8 International Conference, ICT-EurAsia 2014, Proceedings*(pp. 602-611). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8407 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-642-55032-4_62

**Implementation of efficient operations over GF(2 ^{32}) using graphics processing units.** / Tanaka, Satoshi; Yasuda, Takanori; Sakurai, Kouichi.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

^{32}) using graphics processing units. in

*Information and Communication Technology - Second IFIP TC5/8 International Conference, ICT-EurAsia 2014, Proceedings.*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8407 LNCS, Springer Verlag, pp. 602-611, 2nd IFIP TC5/8 International Conference on Information and Communication Technology, ICT-EurAsia 2014, Bali, Indonesia, 4/14/14. https://doi.org/10.1007/978-3-642-55032-4_62

^{32}) using graphics processing units. In Information and Communication Technology - Second IFIP TC5/8 International Conference, ICT-EurAsia 2014, Proceedings. Springer Verlag. 2014. p. 602-611. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-55032-4_62

}

TY - GEN

T1 - Implementation of efficient operations over GF(232) using graphics processing units

AU - Tanaka, Satoshi

AU - Yasuda, Takanori

AU - Sakurai, Kouichi

PY - 2014/1/1

Y1 - 2014/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84958552033&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84958552033&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-55032-4_62

DO - 10.1007/978-3-642-55032-4_62

M3 - Conference contribution

AN - SCOPUS:84958552033

SN - 9783642550317

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 602

EP - 611

BT - Information and Communication Technology - Second IFIP TC5/8 International Conference, ICT-EurAsia 2014, Proceedings

PB - Springer Verlag

ER -