A Faster Modular Multiplication Based on Key Size Partitioning for RSA Public-Key Cryptosystem

スポンサーリンク

概要

• 論文の詳細を見る

• We propose a new method that can speed up the modular multiplication by physically partitioning the key size into two slices. By using LSB-first and MSB-first approach on two respective partitioned hardware module in parallel, we reduce the number of iterations in modular multiplication from k to k/2 + 1 for k-bit operands, and the resulting performance is doubled when contrasted with an implementation purely by LSB-first or MSB-first approach.

• 社団法人電子情報通信学会の論文
• 2002-04-01

著者

• Kwon Oh-jun

  Division Of Computer And Information Science Sunmoon University

• Jeong Yong-jin

  Dept. Of Electronic Communication Engineering Kwangwoon University

• Lee Seok-yong

  Dept. Of Electronic Communication Engineering Kwangwoon University

関連論文

• A Faster Modular Multiplication Based on Key Size Partitioning for RSA Public-Key Cryptosystem

スポンサーリンク