The Study of Computing The Greatest Common Divisor of Polynomial in GF(p^m) Based on Right-shift K-ary Algorithm
碩士 === 義守大學 === 資訊工程學系碩士班 === 96 === The Euclidean algorithm is the ancient and the most common algorithm used for computing the greatest common divisor of polynomials (GCDP) in Galois fields GF(2^m). But it is inefficient for computing GCDP in the long polynomials. In 2006, Argüello improved the Eu...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2008
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/82235690441547202566 |