Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Journal articles
  4. Fast polynomial inversion for post quantum QC-MDPC cryptography
 
research article

Fast polynomial inversion for post quantum QC-MDPC cryptography

Drucker, Nir
•
Gueron, Shay
•
Kostic, Dusan  
December 1, 2021
Information And Computation

New post-quantum Key Encapsulation Mechanism (KEM) designs, evaluated as part of the NIST PQC standardization Project, pose challenging tradeoffs between communication bandwidth and computational overheads. Several KEM designs evaluated in Round-2 of the project are based on QC-MDPC codes. BIKE-2 uses the smallest communication bandwidth, but its key generation requires a costly polynomial inversion. In this paper, we provide details on the optimized polynomial inversion algorithm for QC-MDPC codes (originally proposed in the conference version of this work). This algorithm makes the runtime of BIKE-2 key generation tolerable. It brings a speedup of 11.4x over the commonly used NTL library, and 83.5x over OpenSSL. We achieve additional speedups by leveraging the latest Intel's Vector-PCLMULQDQ instructions, 14.3x over NTL and 103.9x over OpenSSL. Our algorithm and implementation were the reason that BIKE team chose BIKE-2 as the only scheme for its Round-3 specification (now called BIKE). (C) 2021 The Authors. Published by Elsevier Inc.

  • Details
  • Metrics
Type
research article
DOI
10.1016/j.ic.2021.104799
Web of Science ID

WOS:000721215200050

Author(s)
Drucker, Nir
Gueron, Shay
Kostic, Dusan  
Date Issued

2021-12-01

Publisher

ACADEMIC PRESS INC ELSEVIER SCIENCE

Published in
Information And Computation
Volume

281

Article Number

104799

Subjects

Computer Science, Theory & Methods

•

Mathematics, Applied

•

Computer Science

•

Mathematics

•

polynomial inversion

•

bike

•

qc-mdpc codes

•

constant-time algorithm

•

constant-time implementation

•

nist pqc round-3

Editorial or Peer reviewed

REVIEWED

Written at

EPFL

EPFL units
LACAL  
Available on Infoscience
December 4, 2021
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/183578
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés