Presentation 2004-12-17
Experiments on the modulo p+1 and p+2 method for fast modular multiplication
Hidetaka KOJIMA, Akira HAYASHI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) The algorithm proposed by A. Hayashi is one of the methods for fast modular multiplication, which is needed in many cryptographic algorithms such as RSA, DH key exchange, and ElGamal scheme among others. This method makes use of n + 1 and n + 2 as moduli instead of n, and parallel computation with use of Chinese Remainder Theorem. We made comparison of computation time of modular multiplication between the above method and the usual one. We conclude that Hayashi's method outperforms the usual one in speed if the number of factors of n + 1 and n + 2 is greater than 2.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) modular exponentiation method / Chinese Remainder Theorem
Paper # ISEC2004-99
Date of Issue

Conference Information
Committee ISEC
Conference Date 2004/12/10(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) Experiments on the modulo p+1 and p+2 method for fast modular multiplication
Sub Title (in English)
Keyword(1) modular exponentiation method
Keyword(2) Chinese Remainder Theorem
1st Author's Name Hidetaka KOJIMA
1st Author's Affiliation Kanazawa Institute of Technology()
2nd Author's Name Akira HAYASHI
2nd Author's Affiliation Kanazawa Institute of Technology
Date 2004-12-17
Paper # ISEC2004-99
Volume (vol) vol.104
Number (no) 527
Page pp.pp.-
#Pages 4
Date of Issue