Lookup Table Based Multiplication Technique for GF(2^m)
碩士 === 義守大學 === 資訊工程學系 === 101 === This thesis presents the look-up table method and Horner rule to speed up finite field multiplication in the standard basis. The polynomial can be simplified by Horner rule, and dividing into many terms. The many terms make a look-up table which is used to calcul...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2013
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/14801395875784364639 |
| Summary: | 碩士 === 義守大學 === 資訊工程學系 === 101 === This thesis presents the look-up table method and Horner rule to speed up finite field multiplication in the standard basis. The polynomial can be simplified by Horner rule, and dividing into many terms. The many terms make a look-up table which is used to calculate the permutations and combinations of the results. The method can reduce the number of shift and bitwise XOR operation. Therefore, the purposes of accelerating multiplication can be applied in a larger finite field operation, such as Elliptic curve cryptography.
|
|---|