Implementation of Montgomery's Modulation Multiplication Algorithm Using Systolic Array
碩士 === 元智大學 === 電資與資訊工程研究所 === 86 === As the use of telecommunication networks expands continuously right now, the demand for increasing communication security becomes an important issue. RSA cryptosystem is the best known, most versatile and widely used p...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Online Access: | http://ndltd.ncl.edu.tw/handle/72039174568801848790 |
| Summary: | 碩士 === 元智大學 === 電資與資訊工程研究所 === 86 === As the use of telecommunication networks expands continuously
right now, the demand for increasing communication security
becomes an important issue. RSA cryptosystem is the best known,
most versatile and widely used public key cryptosystem today.
It has often been called a de facto standard in public key
cryptosystem.
The basic operation of RSA algorithm is modular exponentiation
on extremely long bit streams (typically 512 to 1024 bits)
which will take a lot of computing time. Modular exponentiation
can be performed by a series of modular multiplication.
Recently proposed methods for faster implementation of modular
multiplication were based on the Montgomery's modular
multiplication algorithm. Most of these methods use
Montgomery's algorithm from the system level, but overlook the
aspect about the data flow and interface. In this thesis, we
proposed a modified architecture to avoid these problems. This
architecture can implement the Montgomery's modular
multiplication with a better interface and more improvement
on the chip area and operation speed.
|
|---|