Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.date | 2018 | |
| dc.date.accessioned | 2025-08-22T12:18:32Z | - |
| dc.date.available | 2025-08-22T12:18:32Z | - |
| dc.date.issued | 2018 | |
| dc.identifier.identifier | Dspace\SGAU\20180518\69655 | |
| dc.identifier.citation | Labunets V.G. Cryptosystems based on RS and BCH codes over finite noncommutative algebras / Labunets V.G., Osthaimer E. // // Сборник трудов IV международной конференции и молодежной школы «Информационные технологии и нанотехнологии» (ИТНТ-2018) - Самара: Новая техника, 2018. - С.2652-2658 | |
| dc.identifier.uri | http://repo.ssau.ru/jspui/handle/123456789/13744 | - |
| dc.description.abstract | The purpose of this paper is to introduce new cryptosystems based on linear ReedSolomon (RC) and Bose-Chaudhuri-Hocquenghem (BCH) codes over finite Cayley-Dickson and finite Clifford algebras with fast code and encode procedures based on fast FourierClifford-Galois and Fourier- Cayley-Dickson-Galois transforms. | |
| dc.description.sponsorship | This work was supported by grants the RFBR № 17-07-00886 and by Ural State Forest Engineering’s Center of Excellence in ”Quantum and Classical Information Technologies for Remote Sensing Systems”. | |
| dc.language | en | |
| dc.publisher | Новая техника | |
| dc.title | Cryptosystems based on RS and BCH codes over finite noncommutative algebras | |
| dc.type | Article | |
| local.identifier.olduri | http://repo.ssau.ru/handle/Informacionnye-tehnologii-i-nanotehnologii/Cryptosystems-based-on-RS-and-BCH-codes-over-finite-noncommutative-algebras-69655 | |
| local.identifier.olduri | http://repo.ssau.ru/handle/Informacionnye-tehnologii-i-nanotehnologii/Cryptosystems-based-on-RS-and-BCH-codes-over-finite-noncommutative-algebras-69655 | |
| Appears in Collections: | Информационные технологии и нанотехнологии | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| paper_357.pdf | основная статья | 167.37 kB | Adobe PDF | View/Open |
Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.