DSpace Repository
Analysis of simple inversable functions defined on Galois Fields for cryptography use [articol]
JavaScript is disabled for your browser. Some features of this site may not work without it.
| dc.contributor.author | Scripcariu, Luminiţa | |
| dc.contributor.author | Duma, Petruţ | |
| dc.date.accessioned | 2021-09-21T06:48:01Z | |
| dc.date.available | 2021-09-21T06:48:01Z | |
| dc.date.issued | 2004 | |
| dc.identifier.citation | Scripcariu, Luminiţa. Analysis of simple inversable functions defined on Galois Fields for cryptography use. Timişoara: Editura Politehnica, 2004 | en_US |
| dc.identifier.uri | http://primo.upt.ro:1701/primo-explore/search?query=any,contains,Analysis%20of%20simple%20inversable%20functions%20defined%20on%20Galois%20Fields%20for%20cryptography%20use&tab=default_tab&search_scope=40TUT&vid=40TUT_V1&lang=ro_RO&offset=0 Link Primo | |
| dc.description.abstract | The private character of the information transmitted on a communication channel or network could be ensured using some cryptography codes. Different encryption techniques performances depend on the processing time and the complexity of the encoding algorithm. We propose a new and advantageous method for symbol permutation, using inversable algebraic function defined on Galois Fields (GF), which minimizes the necessary memory capacity of the encoding algorithm, ensures a great diversity of data and is harder to attack. | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | Timişoara : Editura Politehnica | en_US |
| dc.relation.ispartofseries | Buletinul ştiinţific al Universităţii „Politehnica” din Timişoara, România. Seria electronică şi telecomunicaţii, Tom 49(63), fasc. 2 (2004), p. 55-59 | |
| dc.subject | Encryption | en_US |
| dc.subject | Permutation | en_US |
| dc.subject | Galois Field | en_US |
| dc.title | Analysis of simple inversable functions defined on Galois Fields for cryptography use [articol] | en_US |
| dc.type | Article | en_US |
