타입 II 최적 정규기저를 갖는 GF(2^n)의 곱셈기
Type II Optimal Normal Basis Multipliers in GF(2^n)
1
조회
0
다운로드
1
인용
0
참고문헌
키워드
초록
본 논문에서는 타입 II 최적 정규기저를 갖는 유한체 GF(2^n)의 Semi-Systolic 곱셈기를 제안한다. 본 곱셈기는 기존의 2012년에 발표된 Chiou 등의 곱셈기에 비해 공간복잡도 면 에서는 전체 트랜지스터가 2^n2+44n+26개 줄고 시간복잡도는 4 클럭 감소한다. 즉, NIST의 ECDSA를 위한 권장 유한체 GF(2^333)인 경우 공간복잡도는6.4% 줄고 시간복잡도는 2% 정도 줄어든다. 또한 이 구조는 2009년에 Chiou 등이 제안한 동시오류탐지 및 정정방법을 그대로 적용할 수 있는 장점도 있다.
Abstract
In this paper, we proposed a Semi-Systolic multiplier of GF(2^n) with Type II optimal Normal Basis. Comparing the complexity of the proposed multiplier with Chiou’s multiplier proposed in 2012, it is saved 2^n2+44n+26 in total transistor numbers and decrease 4 clocks in time delay. This means that, for GF(2^333) of the field recommended by NIST for ECDSA, the space complexity is 6.4% less and the time complexity of the 2% decrease. In addition, this structure has an advantage as applied to Chiou’s method of concurrent error detection and correction in multiplication of GF(2^n).
참고문헌 (10)
- S. Kwon, "A Low Complexity and a Low Latency Bit Parallel Systolic Multiplier over Using an Optimal Normal Basis of Type II", Proc. 16th IEEE Symp. Computer Arithmetic, pp.196~202 (2003)
- C. H. Kim, "A New Parallel Multiplier for Type II Optimal Normal Basis", CIS 2006, pp.460~469 (2006)
- A. Reyhani-Masoleh, "Efficient Algorithms and Architecture for Finite Multiplication Using Gaussian Normal Bases", IEEE Trans. computers, 55(1), pp.34~47 (2006)
- A. Reyhani-Masoleh, "A New Construction of Massey-Omura Parallel Multiplier over ", IEEE Trans. computers, 51(5), pp.512~520 (2002)
- Digital Signature Standard, "Nat’1 Inst. of Standard and Technology", FIPS, ~, pp.Publication 182-2 (2000)
- E. R. Berlekamp, "Bit-Serial Reed-Solomon Encoders", IEEE Trans. on info. Theory, 28, pp.869~874 (1982)
- C. W. Chiou, "Concurrent Error Detection and Correction in Gaussian Normal Basis Multiplier over GF(2^m)", IEEE Trans. computers, 58(6), pp.851~857 (2009)
- N. Weste, "Principles of CMOS Design : A system perspective" (1985), Addison-Wesley
- C. W. Chiou, "Low-Complexity Gaussian Normal Basis Multiplier over GF(2^m)", IET Information Security, 6(4), pp.310~317 (2012)
- A. J. Menezes, "Applications of Finite Fields" (1993), Kluwer Academic Publishers