A Verifiable Encryption Scheme Based on Two Hard Problems
碩士 === 逢甲大學 === 資訊工程所 === 98 === This paper proposes a verifiable public key encryption scheme which is based on two number-theoretic hard problems, namely factoring problem and Diffie- Hellman problem. In other words, to break the encryption scheme, the attacker has to solve the two hard problems s...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2010
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/44957923517436730522 |