Proceedings of the 7th Mathematics, Science, and Computer Science Education International Seminar, MSCEIS 2019, 12 October 2019, Bandung, West Java, Indonesia

Research Article

The Efficient Multiplier GF(28) is Formed by The NAYK Algorithm

Download481 downloads
Cite
BibTeX Plain Text
  • @INPROCEEDINGS{10.4108/eai.12-10-2019.2296349,
    author={Muhamad  Nursalman and Arif  Sasongko},
    title={The Efficient Multiplier GF(28) is Formed by The NAYK Algorithm},
    proceedings={Proceedings of the 7th Mathematics, Science, and Computer Science Education International Seminar, MSCEIS 2019, 12 October 2019, Bandung, West Java, Indonesia},
    publisher={EAI},
    proceedings_a={MSCEIS},
    year={2020},
    month={7},
    keywords={efficient multiplier finite field gf(28) nayk algorithm generalization of karatsuba algorithm},
    doi={10.4108/eai.12-10-2019.2296349}
}
  • Muhamad Nursalman
    Arif Sasongko
    Year: 2020
    The Efficient Multiplier GF(28) is Formed by The NAYK Algorithm
    MSCEIS
    EAI
    DOI: 10.4108/eai.12-10-2019.2296349
Muhamad Nursalman1,*, Arif Sasongko2
  • 1: Department of Computer Science Education, FPMIPA, Universitas Pendidikan Indonesia
  • 2: School of Electronics and informatics Engineering, Institut Teknologi Bandung
*Contact email: mnursalman@upi.edu

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(28) will be formed with the NAYK algorithm without being constructed from the smallest values, but directly from the value 8 itself. In comparison with the results of the Generalization of Karatsuba Algorithm, the NAYK algorithm provides a more efficient solution.

Keywords
efficient multiplier finite field gf(28) nayk algorithm generalization of karatsuba algorithm
Published
2020-07-30
Publisher
EAI
http://dx.doi.org/10.4108/eai.12-10-2019.2296349
Copyright © 2019–2024 EAI