Skip to content
akaturk Academic measurement

Article detail · 2019

An efficient optimal normal basis type II multiplier

Journal

IEEE Transactions on Computers

ISSN 0018-9340

YÖKSİS OpenAlex SJR Q1 JCR Q2 Citations 138 Top 1% Percentile 99.4% FWCI 29.03
Year
2019
Type
article

Data source split

  • YÖKSİS YÖKSİS article record
  • YÖKSİS venue IEEE Transactions on Computers
  • Catalog match (ISSN) IEEE Transactions on Computers
  • OpenAlex OpenAlex enrichment (abstract, citations, topics)

Abstract

OpenAlex · English

This paper presents a new parallel multiplier for the Galois field GF(2/sup m/) whose elements are represented using the optimal normal basis of type II. The proposed multiplier requires 1.5(m/sup 2/-m) XOR gates, as compared to 2(m/sup 2/-m) XOR gates required by the Massey-Omura multiplier. The time complexities of the proposed and the Massey-Omura multipliers are similar.

Topics

Citations

OpenAlex cited_by_count. Not a WoS or Scopus citation count; those sources have no separate column here.

138 citations

OpenAlex cited_by_count (cache / database)

2 publications in the local catalog that cite this work (OpenAlex reference match; not the full global list).

  1. A Matrix Decomposition Method for Optimal Normal Basis Multiplication 2016 Citations 2 · OpenAlex
  2. A Matrix Decomposition Method for Optimal Normal Basis Multiplication. 2015 Citations 0 · OpenAlex

Authors

  1. Berk Sunar
  2. ÇETİN KAYA KOÇ EGE ÜNİVERSİTESİ