Efficient finite field multiplication for isogeny based post quantum cryptography

Angshuman Karmakar, Sujoy Sinha Roy, Frederik Vercauteren, Ingrid Verbauwhede

Research output: Chapter in Book/Report/Conference proceedingConference contribution

13 Citations (Scopus)
90 Downloads (Pure)

Abstract

Isogeny based post-quantum cryptography is one of the most recent addition to the family of quantum resistant cryptosystems. In this paper we propose an efficient modular multiplication algorithm for primes of the form p =2· 2a3b − 1withb even, typically used in such cryptosystem. Our modular multiplication algorithm exploits the special structure present in such primes. We compare the efficiency of our technique with Barrett reduction and Montgomery multiplication. Our C implementation shows that our algorithm is approximately 3 times faster than the normal Barrett reduction.

Original languageEnglish
Title of host publicationArithmetic of Finite Fields
Subtitle of host publication6th International Workshop, WAIFI 2016, Ghent, Belgium, July 13-15, 2016, Revised Selected Papers
EditorsSylvain Duquesne, Svetla Petkova-Nikova
PublisherSpringer Verlag
Pages193-207
Number of pages15
ISBN (Electronic)9783319552279
ISBN (Print)9783319552262
DOIs
Publication statusPublished - 9 Mar 2017
Event6th International Workshop on Arithmetic of Finite Fields, WAIFI 2016 - Ghent, Belgium
Duration: 13 Jul 201615 Jul 2016

Publication series

NameLecture Notes in Computer Science
Volume10064
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference6th International Workshop on Arithmetic of Finite Fields, WAIFI 2016
Country/TerritoryBelgium
City Ghent
Period13/07/1615/07/16

Keywords

  • Isogeny
  • Modular multiplication
  • Post-quantum cryptography

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'Efficient finite field multiplication for isogeny based post quantum cryptography'. Together they form a unique fingerprint.

Cite this