RUS  ENG
Full version
JOURNALS // Prikladnaya Diskretnaya Matematika. Supplement // Archive

Prikl. Diskr. Mat. Suppl., 2018 Issue 11, Pages 142–143 (Mi pdma387)

Computational methods in discrete mathematics

A compact realisation of the multiplicative inverse function in the finite field $\mathbb F_{2^{16}}$

I. E. Kokoshinskiy

Mechanics and Mathematics Department, Novosibirsk State University, Novosibirsk

Abstract: In the paper, the well-known method for compact realization of the multiplicative inverse function in the field $\mathbb F_{2^8}$ is researched and expanded to the $\mathbb F_{2^{16}}$ field. We have got a size estimation for the multiplicative inverse function in the $\mathbb F_{2^{16}}$ field and proved a theorem showing that there exists a compact realization of the multiplicative inverse function in the field $\mathbb F_{2^{16}}$ that uses for its calculations at most 336 XORs and 189 ANDs, or 777 GE.

Keywords: block cipher, Galois field, Galois field multiplicative inverse function, lightweight cryptography, gate equivalent (GE).

UDC: 519.7

DOI: 10.17223/2226308X/11/44



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025