Nursalman, Muhamad and Sasongko, Arif (2020) The Efficient Multiplier GF(28) is Formed by The NAYK Algorithm. In: Proceedings of the 7th Mathematics, Science, and Computer Science Education International Seminar, MSCEIS 2019, 12 October 2019, Bandung, West Java, Indonesia.
![[thumbnail of 39782.pdf]](http://eprints.eai.eu/style/images/fileicons/application_pdf.png "39782.pdf")
PDF
39782.pdf
Download (351kB)
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 c
| Item Type: | Conference or Workshop Item (UNSPECIFIED) |
|---|---|
| Date Deposited: | 04 Mar 2026 13:29 |
| Last Modified: | 17 Apr 2026 10:45 |
| URI: | http://eprints.eai.eu/id/eprint/30008 |
Actions (login required)
- View Item