Cryptographically Strong Pseudorandom Functions and Their Applications
碩士 === 國立中興大學 === 資訊科學系所 === 94 === Modern cryptology is largely based on Computational Complexity Theory. A realistic program corresponds to an algorithm or a Turing machine in the theory. An algorithm running in probabilistic polynomial time is considered to be a feasible method. For instance, for...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2006
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/75520993414843530607 |