Modified multiplying matrix for Galois field GF(2m) multiplier structural complexity evaluation
| dc.citation.conference | Litteris et Artibus | |
| dc.contributor.affiliation | Lviv Polytechnic National University | uk_UA |
| dc.contributor.author | Hlukhova, Aleksandra | |
| dc.coverage.country | UA | uk_UA |
| dc.coverage.placename | Lviv | uk_UA |
| dc.date.accessioned | 2018-03-01T13:48:01Z | |
| dc.date.available | 2018-03-01T13:48:01Z | |
| dc.date.issued | 2015 | |
| dc.description.abstract | Method of structural complexity estimation of modified multiplying matrix with ordered structure is proposed. The method is based on total length of connections inside multiplying matrix calculation. Matrix with ordered structure allows a partition to the same sub-matrix. One submatrix can be serially used for multiplication instead of one large unmodified matrix. Multiplier structural complexity can be reduced more than 100 times. | uk_UA |
| dc.format.pages | 32-33 | |
| dc.identifier.citation | Hlukhova A. Modified multiplying matrix for Galois field GF(2m) multiplier structural complexity evaluation / Aleksandra Hlukhova // Litteris et Artibus : proceedings of the 5th International youth science forum, November 26–28, 2015, Lviv, Ukraine / Lviv Polytechnic National University. – Lviv : Lviv Polytechnic Publishing House, 2015. – P. 32–33. – Bibliography: 7 titles. | uk_UA |
| dc.identifier.uri | https://ena.lpnu.ua/handle/ntb/39488 | |
| dc.language.iso | en | uk_UA |
| dc.publisher | Lviv Polytechnic Publishing House | uk_UA |
| dc.relation.referencesen | [1] Elias Rodrigue. Design of an Elliptic Curve Cryptography Using A Finite Field Multiplier in GF(2521). Proceedings of the Lviv Polytechnic National University “Computer Systems and Networks” – Lviv, 2009. – № 658. – Pp. 144 – 149. [2] V.Hlukhov. Matrices operations in Galois fields features. Proceedings of the Lviv Polytechnic National University “Computer systems design. Theory and Practice” – Lviv, 2006. – № 564. – Pp. 35-39. [3] Hlukhov V., Elias R. Sectional multiplier for optimal normal basis of type 2 Galois field GF(2m) elements core generator // Proceedings of the Lviv Polytechnic National University “Computer Science and Information Technology” – Lviv, 2012. – № 732. – Pp. 78 – 84. [4] V. Hlukhov, R. Elias, A. Melnyk. Features of the FPGA-based Galois field GF(2m) elements sectional multipliers with extra large exponent. // "Computer- Integrated Technologies: education, science and industry" – Lutsk National Technical University. № 12, 2013. Pp. 103 – 106. [5] V. Hlukhov, A. Hlukhova. Galois field elements multipliers structural complexity evaluation. Proceedings of the 6-th International Conference ACSN-2013. September 16-18, 2013. Lviv, Ukraine. Pp. 18-19. [6] Hlukhova O. V., Іgnatovich A. O., Lozinsky A. Y., Yaremchuk R. І. Analіtichna otsіnka strukturnoi skladnostі pomnozhuvachіv elementіv polіv Galois // ACIT'5. "Suchasnі kompyuternі іnformatsіynі tehnologіi." TNEU. – Ternopol. 22-23 Travnia 2015. – C. 169-171. [7] V. S. Hlukhov, R. Elіas. Zmenshennya strukturnoi skladnostі bagatosektsіynih pomnozhuvachіv elementіv polіv Galois. Elektrotehnichni ta komp`yuterni Systemy. – Odessa – 2015. Vydavnytstvo Nauka i tehnіka. – № 19 (95). – S. 222 – 226. | uk_UA |
| dc.subject | Galois field GF(2m) | uk_UA |
| dc.subject | Gaussian normal base of type 2 | uk_UA |
| dc.subject | scalable multiplying | uk_UA |
| dc.subject | core generator | uk_UA |
| dc.subject | structural complexity | uk_UA |
| dc.title | Modified multiplying matrix for Galois field GF(2m) multiplier structural complexity evaluation | uk_UA |
| dc.type | Conference Abstract | uk_UA |