We extend the binary algorithm invented by J. Stein and propose two iterative division algorithms in finite field GF(2m). Algorithm EBg exhibits faster convergence while algorithm EBd has reduced complexity in each iteration. A (semi-)systolic array is designed for Algorithm EBd, resulting in an area-time complexity better than the best result known to date based on the extended Euclid algorithm.
|主出版物標題||Midwest Symposium on Circuits and Systems|
|出版狀態||Published - 2000|
|事件||43rd Midwest Circuits and Systems Conference (MWSCAS-2000) - Lansing, MI, United States|
持續時間: 2000 8月 8 → 2000 8月 11
|Other||43rd Midwest Circuits and Systems Conference (MWSCAS-2000)|
|期間||00-08-08 → 00-08-11|
All Science Journal Classification (ASJC) codes