This paper presents bit-serial arithmetic architectures for GF(2m) based on an irreducible all one polynomial. First, modular multiplier and squarer are designed. Then, two arithmetic architectures are proposed based on the modular multiplier and squarer. Proposed architectures hybrid the advantages of hardware and time complexity from previous architectures. They can be used as kernel architecture for modular exponentiations, which is very important operation in the most of public key cryptosystem. Since the multipliers have low hardware requirements and regular structures, they are suitable for VLSI implementation.
CITATION STYLE
Kim, H. S., & Yoo, K. Y. (2002). Bit-serial AOP arithmetic architectures over GF(2m). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2437, pp. 303–313). Springer Verlag. https://doi.org/10.1007/3-540-45831-x_21
Mendeley helps you to discover research relevant for your work.