Low Complexity Digit-Serial Multiplier Over GF(2^m) Using Karatsuba Algorithm
碩士 === 國立臺北科技大學 === 電腦與通訊研究所 === 101 === In recent year, information security and cryptography is important. This work presents a low complexity digit-serial GF(2^m) multiplier, we are using digit-serial of concept to combine the principle of Karatsuba multiplier which can reduce circuit space compl...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2013
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/k5ntd2 |