Browse > Article
http://dx.doi.org/10.13089/JKIISC.2002.12.2.45

$AB^2$ Semi-systolic Architecture over GF$GF(2^m)$  

이형목 (경북대학교 컴퓨터공학과 정보보호 연구실)
전준철 (경북대학교 컴퓨터공학과 정보보호 연구실)
유기영 (경북대학교 컴퓨터공학과 정보보호 연구실)
김현성 (경일대학교 컴퓨터공학과)
Abstract
In this contributions, we propose a new MSB(most significant bit) algorithm based on AOP(All One Polynomial) and two parallel semi-systolic architectures to computes $AB^2$over finite field $GF(2^m)$. The proposed architectures are based on standard basis and use the property of irreducible AOP(All One Polynomial) which is all coefficients of 1. The proposed parallel semi-systolic architecture(PSM) has the critical path of $D_{AND2^+}D_{XOR2}$ per cell and the latency of m+1. The modified parallel semi-systolic architecture(WPSM) has the critical path of $D_{XOR2}$ per cell and has the same latency with PSM. The proposed two architectures, PSM and MPSM, have a low latency and a small hardware complexity compared to the previous architectures. They can be used as a basic architecture for exponentiation, division, and inversion. Since the proposed architectures have regularity, modularity and concurrency, they are suitable for VLSI implementation. They can be used as a basic architecture for algorithms, such as the Diffie-Hellman key exchange scheme, the Digital Signature Algorithm(DSA), and the ElGamal encryption scheme which are needed exponentiation operation. The application of the algorithms can be used cryptosystem implementation based on elliptic curve.
Keywords
Galois field; AOP(All One Polynomia1); Semi-systolic; Cryptosystem;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 High-speed implementation of an ECC-based wireless authentication protocol on an ARM microprocessor /
[ M. Aydos;T. Yanik;C. K. Koc ] / IEE Proc. Comm.   DOI   ScienceOn
2 Systolic multiplliers for finite fields GF(2m) /
[ C. S. Yeh;S. Reed;T.K. Truong ] / IEEE Trans. on Computers   DOI   ScienceOn
3 Discrete logarithms in finite fields and their cryptographic significance /
[ A. M. Odlyzko ] / Adv. cryptol., Proc. Eurocrypt 84
4 Structure of parallel multipliers for a class of finite fields GF(2m) /
[ T. Itoh;S. Tsujii ] / IEEE Info. Comp.   DOI
5 Galois switching function and their applications /
[ B. Benjauthrit;I. S. Reed ] / IEEE Trans. on Computers   DOI
6 The art of Computer Programing /
[ D. E. Knuth ] / Fundamental Algorithm(2nd edition)
7 Effcient Semi-systolic Architectures for finite fields Arithmetic /
[ S. K. Jain;L. Song ] / IEEE Trans. on VLSI System
8 New Directions in Cryptography /
[ W. Diffie;M. Hellman ] / IEEE Trans. on Info. Theory   DOI
9 /
[ D. E. R. Denning ] / Cryptography and data security
10 New Systolic for AB²+C, Inversion and Division in GF(2m) /
[ C. L. Wang;Y. H. Guo ] / IEEE Trans. on Computers   DOI   ScienceOn
11 The use of finite fields to compute convolutions /
[ I. S. Reed;T. K. Truong ] / IEEE Trans. Inform. Theory
12 Computational method and apparatus for finite field arithmetic /
[ J. L. Massey;J. K. Omura ] / U. S. Patent application
13 /
[ W. W. Peterson;E. J. Weldon ] / Error-Correcting Codes
14 Bit-Serial AOP Arithmetic Architecture for Modular Exponentiation /
[ H. S. Kim ] / Ph.D. Thesis
15 Modular Construction of low complexity parallel multipliers for a class of finite fields GF(2m) /
[ M. A. Hasan;M. Z. Wang;V. K. Bhargava ] / IEEE Trans. on Computers   DOI   ScienceOn
16 /
[ S. Y. Kung ] / VLSI Array Processors
17 Recommendations on a new cellular encryption standard using elliptic curve cryptography /
[ V. Pandiarajan;T. L. Martin;L. L. Joiner ] / IEEE Proceedings
18 /
[ E. R. berlekamp ] / Algebraic Coding Theory