Parall RSA Factoring
碩士 === 國立交通大學 === 資訊工程系 === 88 === Many real-world cryptographic applications are based in part on the RSA algorithm, whose security lies in the intractability of factoring large integers. Every positive integer is expressible as a product of prime numbers, in a unique way. Although it is...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2000
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/80292674082308140881 |