Binary fields on limited systems

The intrinsic structure of binary fields poses a challenging complexity problem from both hardware and software point of view. Motivated by applications to modern cryptography, we describe some simple techniques aimed at performing computations over binary fields using systems with limited resources...

Teljes leírás

Elmentve itt :
Bibliográfiai részletek
Szerzők: Nagy Gábor Péter
Lanzone Valentino
Dokumentumtípus: Cikk
Megjelent: Bolyai Institute, University of Szeged Szeged 2014
Sorozat:Acta scientiarum mathematicarum 80 No. 3-4
Kulcsszavak:Matematika
Tárgyszavak:
mtmt:http://dx.doi.org/10.14232/actasm-012-813-7
Online Access:http://acta.bibl.u-szeged.hu/34834
LEADER 01447nab a2200241 i 4500
001 acta34834
005 20260305144026.0
008 161017s2014 hu o 000 eng d
022 |a 0001-6969 
024 7 |a http://dx.doi.org/10.14232/actasm-012-813-7  |2 doi 
040 |a SZTE Egyetemi Kiadványok Repozitórium  |b hun 
041 |a eng 
100 1 |a Nagy Gábor Péter 
245 1 0 |a Binary fields on limited systems  |h [elektronikus dokumentum] /  |c  Nagy Gábor Péter 
260 |a Bolyai Institute, University of Szeged  |b Szeged  |c 2014 
300 |a 409-418 
490 0 |a Acta scientiarum mathematicarum  |v 80 No. 3-4 
520 3 |a The intrinsic structure of binary fields poses a challenging complexity problem from both hardware and software point of view. Motivated by applications to modern cryptography, we describe some simple techniques aimed at performing computations over binary fields using systems with limited resources. This is particularly important when such computations must be carried out by means of very small and simple machines. The algorithms described in the present paper provide an increased efficiency in computations, when compared to the previously known algorithms for the arithmetic over prime fields. 
650 4 |a Természettudományok 
650 4 |a Matematika 
695 |a Matematika 
700 0 1 |a Lanzone Valentino  |e aut 
856 4 0 |u http://acta.bibl.u-szeged.hu/34834/1/math_080_numb_003_004_409-418.pdf  |z Dokumentum-elérés