원문정보
보안공학연구지원센터(IJSIA)
International Journal of Security and Its Applications
Vol.6 No.2
2012.04
pp.223-228
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
This paper presents two parallel algorithms of basic arithmetic operations concerning multiple-precision integers over finite field GF(2n). The parallel algorithms of reduction operation and inversion-multiplication operation are designed by analyzing their data dependencies. Time complexities of the parallel algorithms and the sequential algorithms are calculated to make the quantitative comparison. The performance evaluation shows high efficiencies of the proposed parallel algorithms.
목차
Abstract
1. Introduction
2. Parallel Algorithms over Finite Field GF(2n)
2.1 Parallel Reduction over GF(2n)
2.2 Parallel Inversion-multiplication over GF(2n)
3. Performance Evaluation
4. Conclusions
Acknowledgments
References
1. Introduction
2. Parallel Algorithms over Finite Field GF(2n)
2.1 Parallel Reduction over GF(2n)
2.2 Parallel Inversion-multiplication over GF(2n)
3. Performance Evaluation
4. Conclusions
Acknowledgments
References
저자정보
참고문헌
자료제공 : 네이버학술정보