| Summary: | 碩士 === 國立中正大學 === 資訊工程研究所 === 82 === In this paper, we make an improvement on Harn and Kiesler's
proabilistic encryption scheme. An efficient probabilistic
encryption scheme is then proposed. Our scheme utilizes the
concept of public keys and recursively encrypts two bits at a
time. The message bit expansion in our scheme is the same as
twice as fast as Harn and Kiesler's. Furthermore, we propose a
remote scheme for password authentication based on our
improvement. Conventional schemes for this purpose cannot with
of cannot prevent the threat of modification by any malicious
intruder. According to our scheme, we can eliminate these
problems. Furthermore, our scheme can be implemented in smart
cards efficiently.
|
|---|
