Extended NIST prime family for efficient modular reduction

Young In Cho, Nam Su Chang, Chang Han Kim, Seokhie Hong

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

Abstract

The FIPS 186-2 standard recommends five prime fields with a modulus so-called NIST primes for elliptic curve cryptosystems. Primes of the special form such as NIST primes have a property yields modular reduction algorithms that are significantly fast. However the number of NIST primes are not large enough. In this paper, we further extend the idea of NIST primes. Then we find more primes can provide fast modular reduction computation that NIST prime family does not support. Our method provides more efficient modular arithmetic than Montgomery algorithm in prime fields that NIST primes does not support.

Original languageEnglish
Title of host publicationLecture Notes in Electrical Engineering
Pages105-111
Number of pages7
Volume114 LNEE
DOIs
Publication statusPublished - 2012 Jan 1
Event3rd International Conference on Computer Science and Its Applications, CSA 2011 and 2011 FTRA World Convergence Conference, WCC 2011 - Jeju, Korea, Republic of
Duration: 2011 Dec 122011 Dec 15

Publication series

NameLecture Notes in Electrical Engineering
Volume114 LNEE
ISSN (Print)18761100
ISSN (Electronic)18761119

Other

Other3rd International Conference on Computer Science and Its Applications, CSA 2011 and 2011 FTRA World Convergence Conference, WCC 2011
CountryKorea, Republic of
CityJeju
Period11/12/1211/12/15

    Fingerprint

Keywords

  • Finite field arithmetic
  • Modular arithmetic
  • NIST prime

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering

Cite this

Cho, Y. I., Chang, N. S., Kim, C. H., & Hong, S. (2012). Extended NIST prime family for efficient modular reduction. In Lecture Notes in Electrical Engineering (Vol. 114 LNEE, pp. 105-111). (Lecture Notes in Electrical Engineering; Vol. 114 LNEE). https://doi.org/10.1007/978-94-007-2792-2_10