Time complexity of multipliers for Galois fields

Simple item page
dc.citation.conferenceLitteris et Artibus
dc.contributor.affiliationLviv Polytechnic National Universityuk_UA
dc.contributor.authorRahma, Mohammed Kadhim
dc.contributor.authorHlukhov, Valeriy S.
dc.coverage.countryUAuk_UA
dc.coverage.placenameLvivuk_UA
dc.date.accessioned2018-04-10T13:59:58Z
dc.date.available2018-04-10T13:59:58Z
dc.date.issued2016
dc.description.abstractMultipliers for binary Galois field GF (2n) hardware complexity allows to implement in FPGA an operational device with multiple multipliers. But because of large structural complexity for some combinations of large degrees n of field and the multipliers number to make it is practically impossible. One of the possible choices of this problem solving is the move to using Galois fields with the base d, greater than 2. Multipliers for such extended Galois field GF (dm) with approximately the same number of elements dm  2n are estimated in the article in terms of their time complexity to determine the fields in which the multiplier will have the least time complexity.uk_UA
dc.format.pages53-54
dc.identifier.citationRahma M. K. Time complexity of multipliers for Galois fields / Mohammed Kadhim Rahma, Valeriy S. 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. 53–54. – Bibliography: 10 titles.uk_UA
dc.identifier.urihttps://ena.lpnu.ua/handle/ntb/40249
dc.language.isoenuk_UA
dc.publisherLviv Polytechnic Publishing Houseuk_UA
dc.relation.referencesen[1] DSTU 4145-2002. Informatsiyni tekhnolohiyi. Kryptohrafichnyy zakhyst informatsiyi. Tsyfrovyy pidpys, shcho gruntuyet'sya na eliptychnykh kryvykh. Formuvannya ta pereviryannya [Information Technology. Cryptographic Techniques. Digital Signatures Based on Elliptic Curves. Generation and Verification]. Derzhavnyy komitet Ukrayiny z pytan' tekhnichnoho rehulyuvannya ta spozhyvchoyi polityky, Kiyv, Ukraine, 2003 (In Ukrainian). [2] H.H. Guild. Fully iterative fast array for binary multiplication and addition. Electronics Letters, Volume 5, Issue 12, 12 June 1969, page 263 (In English). [3] V.S. Hlukhov, R.M.Elias, A.O.Mel'nyk. Osoblyvosti realizatsiyi na PLIS sektsiynykh pomnozhuvachiv elementiv poliv Halua GF(2m) z nadvelykym stepenem [Features of the FPGA-based Galois Field GF(2m) Elements Sectional Multipliers with Extra Large Exponent]. Komp"yuterno-intehrovani tekhnolohiyi: osvita, nauka, vyrobnytstvo - naukovyy zhurnal, Luts'kyy natsional'nyy tekhnichnyy universytet. Luts'k, Ukraine, 2013, vol. 12, pp. 103 – 106 (In Ukrainian). [4] Hlukhov V. S., Hlukhova O. V. Rezul'taty otsinky strukturnoyi skladnosti pomnozhuvachiv elementiv poliv Halua [Structural Complexity of Galois Field Elements Multipliers Evaluation Results]. Visnyk Natsional'noho universytetu “L'vivs'ka politekhnika” “Komp"yuterni systemy ta merezhi”. Lviv, Ukraine, 2013, vol. 773, pp. 27-32 (In Ukrainian). [5] Hlukhov V. S., Trishch H. M. Otsinka strukturnoyi skladnosti bahatosektsiynykh pomnozhuvachiv elementiv poliv Halua [Evaluation of structural complexity multisection multiplier for Galois field elements]. Visnyk Natsional'noho universytetu “L'vivs'ka politekhnika” “Komp"yuterni systemy ta merezhi”. Lviv, Ukraine, 2014, vol. 806, pp. 27-33 (In Ukrainian). [6] Sholohon O. Z. Obchyslennya strukturnoyi skladnosti pomnozhuvachiv u polinomial'nomu bazysi elementiv poliv Halua GF(2m) [Structural Complexity of Galois Field GF(2m) Elements Multipliers in Polynomial Basis Calculation]. Visnyk Natsional'noho universytetu “L'vivs'ka politekhnika” “Komp"yuterni systemy ta merezhi”. Lviv, Ukraine, 2014, vol. 806, pp. 284-289 (In Ukrainian). [7] Sholohon Yu. Z. Otsinyuvannya strukturnoyi skladnosti pomnozhuvachiv poliv Halua na osnovi elementarnykh peretvoryuvachiv [Based on Elementary Transducers Structural Complexity of Galois Field Multipliers Evaluation]. Visnyk Natsional'noho universytetu “L'vivs'ka politekhnika” “Komp"yuterni systemy ta merezhi”. Lviv, Ukraine, 2014, vol. 806, pp. 290-295 (In Ukrainian). [8] Hlukhov V.S., Elias R. Umenshenie strukturnoy slozhnosti mnogosektsionnyih umnozhiteley elementov poley Galua [Galois Fields Elements Multisection Multipliers Structural Complexity Reduction]. Elektrotehnicheskie i kompyuternyie sistemyi. - 2015. - № 19(95) - pp. 222-226 (In Russian). [9] M. Zholubak, A. T. Kostyk, V. S. Hlukhov. Osoblyvosti opratsyuvannya elementiv triykovykh poliv Halua na suchasniy elementniy bazieskye y komp'yuternыe systemы [Features of processing Binary Galois fields elements on modern hardware base]. Visnyk Natsional'noho universytetu “L'vivs'ka politekhnika” “Komp"yuterni systemy ta merezhi”. Lviv, Ukraine, 2015, vol. 830, pp. 27-33 (In Ukrainian). [10] Spartan-6 Family Overview. DS160 (v2.0) October 25, 2011. © 2009–2011 Xilinx, Inc. (In English).uk_UA
dc.subjecttime complexityuk_UA
dc.subjectGalois fielduk_UA
dc.subjectextended fielduk_UA
dc.subjectfield characteristicuk_UA
dc.subjectdegree of the fielduk_UA
dc.subjectmultiplieruk_UA
dc.titleTime complexity of multipliers for Galois fieldsuk_UA
dc.typeConference Abstractuk_UA

Files

Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
LEA-2016-53-54.pdf
Size:
513.9 KB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
2.99 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Litteris et Artibus. – 2016 р.