|
Fundamentalnaya i Prikladnaya Matematika, 2012, Volume 17, Issue 4, Pages 95–131
(Mi fpm1423)
|
|
|
|
This article is cited in 24 scientific papers (total in 24 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.
Citation:
S. B. Gashkov, I. S. Sergeev, “Complexity of computation in finite fields”, Fundam. Prikl. Mat., 17:4 (2012), 95–131; J. Math. Sci., 191:5 (2013), 661–685
Linking options:
https://www.mathnet.ru/eng/fpm1423 https://www.mathnet.ru/eng/fpm/v17/i4/p95
|
Statistics & downloads: |
Abstract page: | 953 | Full-text PDF : | 201 | References: | 59 | First page: | 1 |
|