Skip to main navigation Skip to search Skip to main content

Implementing fast carryless multiplication

  • Laboratoire d'Informatique (LIX)

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

The efficient multiplication of polynomials over the finite field F2 is a fundamental problem in computer science with several applications to geometric error correcting codes and algebraic crypto-systems. In this paper we report on a new algorithm that leads to a practical speed-up of about two over previously available implementations. Our current implementation assumes a modern AVX2 and CLMUL enabled processor.

Original languageEnglish
Title of host publicationMathematical Aspects of Computer and Information Sciences - 7th International Conference, MACIS 2017, Proceedings
EditorsIlias S. Kotsireas, Johannes Blomer, Dimitris E. Simos, Temur Kutsia
PublisherSpringer Verlag
Pages121-136
Number of pages16
ISBN (Print)9783319724522
DOIs
Publication statusPublished - 1 Jan 2017
Event7th International Conference on Mathematical Aspects of Computer and Information Sciences, MACIS 2017 - Vienna, Austria
Duration: 15 Nov 201717 Nov 2017

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10693 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference7th International Conference on Mathematical Aspects of Computer and Information Sciences, MACIS 2017
Country/TerritoryAustria
CityVienna
Period15/11/1717/11/17

Fingerprint

Dive into the research topics of 'Implementing fast carryless multiplication'. Together they form a unique fingerprint.

Cite this