On Primitive Roots and Chebyshev Polynomials
碩士 === 東海大學 === 應用數學系 === 104 === Diffie-Hellman algorithm is used to obtain a secret key by using a public key. This paper gives an algorithm to find the smallest primitive roots of a prime so that we can obtain a secret key by Diffie-Hellman algorithm via Chebyshev polynomials. Key words: public...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2016
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/99133207448466423634 |