A compact realisation of the multiplicative inverse function in the finite field F216
In the paper, the well-known method for compact realization of the multiplicative inverse function in the field F28 is researched and expanded to the F2i6 field. We have got a size estimation for the multiplicative inverse function in the F2i6 field and proved a theorem showing that there exists a compact realization of the multiplicative inverse function in the field F2i6 that uses for its calculations at most 336 XORs and 189 ANDs, or 777 GE.
Download file
Counter downloads: 143
Keywords
блочный шифр, поле Галуа, функция обращения элемента в поле Галуа, легковесная криптография, gate equivalent (GE), block cipher, Galois field, Galois field multiplicative inverse function, lightweight cryptography, gate equivalent (GE)Authors
| Name | Organization | |
| Kokoshinskiy I. E. | Novosibirsk State University | kokoshinskiy.igor@gmail.com |
References
Canright D. A Very Compact Rijndael S-box. Naval Postgraduate School Technical Report: NPS-MA-05-001, 2004.
Canright D. A very compact S-box for AES // LNCS. 2005. V. 3659. P. 440-455.
Rijmen V. Efficient Implementation of the Rijndael S-box. Katholieke Universiteit Leuven, Dept. ESAT, Belgium, 2001.
Satoh A., Morioka S., Takano K., and Munetoh S. A compact Rijndael hardware architecture with S-box optimization // ASIACRYPT 2001. LNCS. 2001. V.2248. P. 239-254.
