Binary fields on limited systems

Nagy, Gábor Péter and Lanzone, v. (2014) Binary fields on limited systems. ACTA SCIENTIARUM MATHEMATICARUM (SZEGED), 80 (3-4). pp. 409-418. ISSN 0001-6969

Preview

Text 1501.03662.pdf Available under License Creative Commons Attribution. Download (181kB) | Preview

Abstract

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.

Actions (login required)

Edit Item