New Qauntum Key Distribution Protocol and Security Proofs based on Sequences of Games
碩士 === 國立成功大學 === 資訊工程學系碩博士班 === 96 === Most classical cryptosystems base their security on mathematical computational problems which cannot be solved in polynomial time complexity, e.g., large number factorization and discrete logarithm problems. However, it is believed that these mathematical prob...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2008
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/90242487963886759661 |