Research Article
The Efficient Multiplier GF(28) is Formed by The NAYK Algorithm
@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
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.
Copyright © 2019–2024 EAI
