Accelerating scalar conversion for Koblitz curve cryptoprocessors on hardware platforms

Research output: Contribution to journalArticlepeer-review

Authors

Colleges, School and Institutes

External organisations

  • KU Leuven

Abstract

Koblitz curves are a class of computationally efficient elliptic curves where scalar multiplications can be accelerated using NAF representations of scalars. However, conversion from an integer scalar to a short NAF is a costly operation. In this paper, we improve the recently proposed scalar conversion scheme based on division by 2. We apply two levels of optimizations in the scalar conversion architecture. First, we reduce the number of long integer subtractions during the scalar conversion. This optimization reduces the computation cost and also simplifies the critical paths present in the conversion architecture. Then we implement pipelines in the architecture. The pipeline splitting increases the operating frequency without increasing the number of cycles. We have provided detailed experimental results to support our claims made in this paper.

Details

Original languageEnglish
Pages (from-to)810-818
JournalIEEE Transactions on Very Large Scale Integration (VLSI) Systems
Volume23
Issue number5
Early online date9 Jun 2014
Publication statusPublished - 1 May 2015

Keywords

  • Architecture, cryptography, field-programmable gate array (FPGA), Koblitz curve, lazy reduction, pipelining, scalar multiplication