Presentation 1997/11/20
Modular Inverse Algorithm Optimized by Initial Operations
Tetsutaro Kobayashi, Hikaru Morita,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) We propose a high speed method to calculate modular inverse over a ring Z^x_Z or a finite field F_p with prime elements for public-key schemes (i.e., elliptic-curve cryptosystems). By making use of a difference between a speed to calculate multiplication by 2^n and one to calculate multiplication by 2^<-n>, and introducing initial operations, a total operation cost can be reduced. This method can be applied to a conventional modular inverse, Shimbo inverse [1], or Kaliski inverse [2] algorithm. We also succeed to optimize an initial operation parameter by considering distributions of input value.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Elliptic-curve cryptosystems / Modular arithmetic / Modular inverse / Montgomery method / Binary GCD
Paper # ISEC97-48
Date of Issue

Conference Information
Committee ISEC
Conference Date 1997/11/20(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Security (ISEC)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Modular Inverse Algorithm Optimized by Initial Operations
Sub Title (in English)
Keyword(1) Elliptic-curve cryptosystems
Keyword(2) Modular arithmetic
Keyword(3) Modular inverse
Keyword(4) Montgomery method
Keyword(5) Binary GCD
1st Author's Name Tetsutaro Kobayashi
1st Author's Affiliation NTT Information and Communication Systems Laboratories()
2nd Author's Name Hikaru Morita
2nd Author's Affiliation NTT Information and Communication Systems Laboratories
Date 1997/11/20
Paper # ISEC97-48
Volume (vol) vol.97
Number (no) 381
Page pp.pp.-
#Pages 11
Date of Issue