## Abstract

Polynomial multiplication over binary fields F2n is a common primitive, used for example by current cryptosystems such as AES-GCM (with n=128). It also turns out to be a primitive for other cryptosystems, that are being designed for the Post Quantum era, with values ngg 128. Examples from the recent submissions to the NIST Post-Quantum Cryptography project, are BIKE, LEDAKem, and GeMSS, where the performance of the polynomial multiplications, is significant. Therefore, efficient polynomial multiplication over F2n, with large n, is a significant emerging optimization target. Anticipating future applications, Intel has recently announced that its future architecture (codename 'Ice Lake') will introduce a new vectorized way to use the current VPCLMULQDQ instruction. In this paper, we demonstrate how to use this instruction for accelerating polynomial multiplication. Our analysis shows a prediction for at least 2x speedup for multiplications with polynomials of degree 512 or more.

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

Title of host publication | Proceedings of the 25th International Symposium on Computer Arithmetic, ARITH 2018 |

Publisher | Institute of Electrical and Electronics Engineers Inc. |

Pages | 115-119 |

Number of pages | 5 |

ISBN (Print) | 9781538626122 |

DOIs | |

State | Published - 13 Sep 2018 |

Event | 25th International Symposium on Computer Arithmetic, ARITH 2018 - Amherst, United States Duration: 25 Jun 2018 → 27 Jun 2018 |

### Publication series

Name | Proceedings - Symposium on Computer Arithmetic |
---|---|

Volume | 2018-June |

### Conference

Conference | 25th International Symposium on Computer Arithmetic, ARITH 2018 |
---|---|

Country/Territory | United States |

City | Amherst |

Period | 25/06/18 → 27/06/18 |

### Bibliographical note

Publisher Copyright:© 2018 IEEE.

## ASJC Scopus subject areas

- Theoretical Computer Science
- Software
- Hardware and Architecture