원문정보
보안공학연구지원센터(IJSEIA)
International Journal of Software Engineering and Its Applications
Vol.7 No.4
2013.07
pp.285-294
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
We describe the design method of the efficient GF(28) multiplier using double subfield transformation. Here we first transform the GF(28) field elements to the GF(24) field elements. And then we again transform the GF(24 field to the GF(22) field. This double transform generates the very fast and cost effective GF(28) multiplier. The Multiplier can be used for the Reed Solomon Error correction and Encription/Decription on the digital communication channel.
목차
Abstract
1. Introduction
2. Transformation between Galois GF(22) and GF(24) Fields
2.1. Transformation between 2 Fields
2.2. GF(22) Multiplier Design
2.3. GF(24 ) Multiplier based on GF(22) Subfield Logic
3. GF(28 ) Multiplier based on GF(22) Subfield Multiplier
3.1. Derivation of GF(28 ) Multiplier Logic based on GF(22) subfield Elements
3.2. Transformation between the GF(28 ) and GF(22) Elements
3.3. The New GF(28 ) Schematic Circuit
4. VHDL Simulation Result
5. Comparison between the New GF(28) Multiplier with Classical Multiplier without the Transformation
6. Conclusion
References
1. Introduction
2. Transformation between Galois GF(22) and GF(24) Fields
2.1. Transformation between 2 Fields
2.2. GF(22) Multiplier Design
2.3. GF(24 ) Multiplier based on GF(22) Subfield Logic
3. GF(28 ) Multiplier based on GF(22) Subfield Multiplier
3.1. Derivation of GF(28 ) Multiplier Logic based on GF(22) subfield Elements
3.2. Transformation between the GF(28 ) and GF(22) Elements
3.3. The New GF(28 ) Schematic Circuit
4. VHDL Simulation Result
5. Comparison between the New GF(28) Multiplier with Classical Multiplier without the Transformation
6. Conclusion
References
키워드
저자정보
참고문헌
자료제공 : 네이버학술정보