Extended finite fields in cryptographic information protection
dc.citation.journalTitle | Advances in Cyber-Physical Systems | |
dc.citation.volume | Volume 1, number 2 | |
dc.contributor.affiliation | Lviv Polytechnic National University | uk_UA |
dc.contributor.author | Popovych, Roman | |
dc.coverage.country | UA | uk_UA |
dc.coverage.placename | Львів | uk_UA |
dc.date.accessioned | 2017-11-24T07:50:25Z | |
dc.date.available | 2017-11-24T07:50:25Z | |
dc.date.issued | 2016 | |
dc.description.abstract | The use of extended finite fields for cryptographic information protection is focused on. In particular, explicit construction in finite fields elements of high multiplicative order is described. The obtained correspondent lower bounds on the order are provided. | uk_UA |
dc.format.pages | 125–129 | |
dc.identifier.citation | Popovych R. Extended finite fields in cryptographic information protection / Roman Popovych // Advances in Cyber-Physical Systems. – 2016. – Volume 1, number 2. – P. 125–129. – Bibliography: 12 titles. | uk_UA |
dc.identifier.uri | https://ena.lpnu.ua/handle/ntb/39362 | |
dc.language.iso | en | uk_UA |
dc.publisher | Publishing House of Lviv Polytechnic National University | uk_UA |
dc.rights.holder | Roman | uk_UA |
dc.subject | information protection | uk_UA |
dc.subject | algebraic structure | uk_UA |
dc.subject | finite field | uk_UA |
dc.subject | multiplicative order | uk_UA |
dc.subject | lower bound | uk_UA |
dc.title | Extended finite fields in cryptographic information protection | uk_UA |
dc.type | Article | uk_UA |