FUNDAMENTALNAYA I PRIKLADNAYA MATEMATIKA

(FUNDAMENTAL AND APPLIED MATHEMATICS)

2011/2012, VOLUME 17, NUMBER 4, PAGES 95-131

Complexity of computation in finite fields

S. B. Gashkov
I. S. Sergeev

Abstract

View as HTML     View as gif image

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

Main page Contents of the journal News Search

Location: http://mech.math.msu.su/~fpm/eng/k1112/k114/k11406h.htm
Last modified: July 2, 2012