| Summary: | 碩士 === 國立交通大學 === 資訊工程研究所 === 82 === There are many security problems in computer systems. One of
them discussed is how to protect private data from taping and
destorying. As the use of network and database systems grows,
the security problem has become more and more important. In
this paper, we define a new concept, (B,M) number system. It is
well known that any n-ary number system can be expressed as a
(B,M) number system. A new asymmetric cipher based on (B,M)
number systems is designed here. To improve performance,
efficient algorithms for en- cryption and decryption are also
presented in this thesis. In our cryptanalysis, it shows that
data expansion is rea- sonable for some B. By considering
random factors involved, Our private key sequence is very hard
to guess. Therefore, our cipher deserves an efficient
asymmetric cryptosystem.
|
|---|
