Research hardware complexity of multipliers of extended Galois field GF(dm)
| dc.citation.conference | Litteris et Artibus | |
| dc.contributor.affiliation | Lviv Polytechnic National University | uk_UA |
| dc.contributor.author | Zholubak, Ivan | |
| dc.contributor.author | Hlukhov, Valeriy | |
| dc.coverage.country | UA | uk_UA |
| dc.coverage.placename | Lviv | uk_UA |
| dc.date.accessioned | 2018-04-16T11:17:10Z | |
| dc.date.available | 2018-04-16T11:17:10Z | |
| dc.date.issued | 2016 | |
| dc.description.abstract | The paper analyzes the hardware costs of multipliers of extended Galois fields GF(dm). There are compared realised on modern FPGA Galois fields multipliers hardware cost to select Galois field GF(dm) with approximately the same number of elements and the lowest multiplier hardware complexity. Totally the hardware cost increases while basics of the field increase. Local minimums for odd d correspond to d = 2i-1 and the global minimum for analisys based on Guild cell with realization like single unit corresponds to the value d = 3 and based on Guild cell with its multiplier and adder separate realization – the value d=7. | uk_UA |
| dc.format.pages | 107-108 | |
| dc.identifier.citation | Zholubak I. Research hardware complexity of multipliers of extended Galois field GF(dm) / Ivan Zholubak, Valeriy Hlukhov // Litteris et Artibus : proceedings of the 6th International youth science forum, November 24–26, 2016, Lviv, Ukraine / Lviv Polytechnic National University. – Lviv : Lviv Polytechnic Publishing House, 2016. – P. 107–108. – Bibliography: 6 titles. | uk_UA |
| dc.identifier.uri | https://ena.lpnu.ua/handle/ntb/40690 | |
| dc.language.iso | en | uk_UA |
| dc.publisher | Lviv Polytechnic Publishing House | uk_UA |
| dc.relation.referencesen | [1] Alexander Kushnerov, Troichnaya cifrovaya tehnica. Perspectivi I sovremennost //Universitet imeny Ben- Huriona, Beyer-ShevaБеєр, Izrail. - 2005. – С.1-7. [2] Oded Goldrich, Foundations of Cryptography, Volume 1: Basic Tools //Cambridge University Press, - 2014 – С.7-10. [3] DSTY 4145-2002. Informaciyni tehnologiyi. Kriptografichniy zahist informaciyi. Cifroviy pidpis, shcho gruntuyetsa na eliptichnih krivih. Formuvanna ta pereviryanna //Derzhavniy komitet Ukrainy z pitan tehnichnoho rehuluvanna ta spozhivchoyi politiky. - 2002. – С.5-7. [4] Hlukhov O.V., Lozinskiy А. Y., Yaremkevich R.І., Ihnatovich А.О// Analitichna ocinka structurnoyi skladnosty pomnozhuvachiv elementiv poliv Halua // АСІТ’2015. – Ternopil: ТНЕУ, 2015. – 1-5 с. [5] Hlukhov V. S., Elias R. М., Melnik А. О. Osoblivosty realizaciyi na PLIS sekciynih pomnozhuvachiv elementiv poliv Halua GF(2m) z nadvelikym stepenem // "Komputerno-intehrovany tehnologiyi: osvita, nauka, vyrobnictvo" – naukoviy zhurnal, Luckiy nacionalniy tehnichniy universitet. – Luck: 2013. - № 12. - С. 103 – 106. [6] Hlukhov V. S., Hlukhova О. V. Resultaty ocinuvanna strukturnoyi skladnosty pomnozhuvachiv elementiv poliv Halua // Visnik Nacionalnoho Universitetu “Lvivska Politehnika “Komputerny systemy ta merezhy”. – Lviv: - 2013. – Vip. 773. - С. 27 - 32. | uk_UA |
| dc.subject | Galois fields GF(dm) | uk_UA |
| dc.subject | multiplier | uk_UA |
| dc.subject | modified Guild cell | uk_UA |
| dc.subject | LUT | uk_UA |
| dc.title | Research hardware complexity of multipliers of extended Galois field GF(dm) | uk_UA |
| dc.type | Conference Abstract | uk_UA |