RUS  ENG
Full version
JOURNALS // Fundamentalnaya i Prikladnaya Matematika // Archive
Fundam. Prikl. Mat., 2012 Volume 17, Issue 4, Pages 95–131 (Mi fpm1423)
This article is cited in 25 papers

Complexity of computation in finite fields

S. B. Gashkov, I. S. Sergeev

M. V. Lomonosov Moscow State University

Abstract: We give a review of some works about the complexity of implementation of arithmetic operations in finite fields by Boolean circuits.

UDC: 512.624


 English version: Journal of Mathematical Sciences (New York), 2013, 191:5, 661–685

Bibliographic databases:

© Steklov Math. Inst. of RAS, 2025