원문정보
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
Hardware implementations of finite field arithmetic using normal basis are advantageous due to the fact that the squaring operation can be done at almost no cost. In this paper, a new word-parallel bit-serial finite field multiplier using normal basis is presented. The proposed architecture takes w clock cycles to compute the product bits, where the value for w, 1≤w≤m, can be arbitrarily selected by the designer to set the trade-off between area and speed. It has been shown that the proposed architecture has significantly lower complexity and critical path delay in comparison to the previously proposed architectures.
목차
Abstract
1. Introduction
2. The Bit-Serial Normal Basis Multiplier over GF(2m)
3. The word-parallel bit-serial normal basis multiplier
4. Conclusion
Acknowledgements
References
1. Introduction
2. The Bit-Serial Normal Basis Multiplier over GF(2m)
3. The word-parallel bit-serial normal basis multiplier
4. Conclusion
Acknowledgements
References
저자정보
참고문헌
자료제공 : 네이버학술정보
