The Efficient Multiplier GF(2^(8)) is Formed by The NAYK Algorithm

Muhamad Nursalman; Arif Sasongko

doi:10.4108/eai.12-10-2019.2296349

The Efficient Multiplier GF(2^(8)) is Formed by The NAYK Algorithm

Open

Muhamad Nursalman, Arif Sasongko

2020 Proceedings of the 7th Mathematics, Science, and Computer Science Education International Seminar, MSCEIS 2019 Conference paper Cited by 1

Abstract

The efficient multiplier in Finite Field is needed in its implementation in the cryptography field. The NAIK algorithm provides fast steps and efficient solutions in forming the desired multiplier. The formation of an efficient multiplier GF(2^8) will be formed with the NAYK algorithm without being constructed from the smallest values, but directly from the value 8 itself. In comparison the NAYK algorithm provides a more efficient solution. Copyright © 2020 EAI

Affiliations

Department of Computer Science Education, FPMIPA, Universitas Pendidikan Indonesia, Indonesia; School of Electronics and Informatics Engineering, Institut Teknologi Bandung, Indonesia

View full text (DOI) →

Research at a Glance

Research at a Glance

Topics & SDG Alignment

Collaboration

Author Profile (Selected)

References Overview

Journal & Source

Metadata & Integrity