Scalable Hardware Architectures for Computing Multiplications over GF(2m)
博士 === 長庚大學 === 電機工程學研究所 === 97 === Abstract Finite (Galois) field GF(2m) has widely applied to error control coding and public-key cryptography. Important operations of finite fields are addition, multiplication and inversion. Addition is very simple and can be implemented using XOR gates circuit....
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Published: |
2009
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/10719954545662263777 |