|
Fundamentalnaya i Prikladnaya Matematika, 2009, Volume 15, Issue 3, Pages 75–111
(Mi fpm1229)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
On hardware and software implementation of arithmetic in finite fields of characteristic 7 for calculation of pairings
S. B. Gashkova, A. A. Bolotovb, A. A. Burtsevc, S. Yu. Zhebetd, A. B. Frolovd a M. V. Lomonosov Moscow State University
b "L-S-I Logic", Co., USA
c Moscow Institute of Physics and Technology
d Moscow Power Engineering Institute (Technical University)
Abstract:
We study scheme (hardware) and program (software) methods of multiplication of polynomials over fields of characteristic 7 in order to apply them to parings based cryptographic protocols on hyperelliptic curves of genus three. We consider hardware and software implementations of arithmetic in $GF(7)$, $GF(7^2)$, $GF(7^n)$, $GF(7^{7n})$, and $GF(7^{14n})$ and estimate the complexity of corresponding schemes and programs.
Citation:
S. B. Gashkov, A. A. Bolotov, A. A. Burtsev, S. Yu. Zhebet, A. B. Frolov, “On hardware and software implementation of arithmetic in finite fields of characteristic 7 for calculation of pairings”, Fundam. Prikl. Mat., 15:3 (2009), 75–111; J. Math. Sci., 168:1 (2010), 49–75
Linking options:
https://www.mathnet.ru/eng/fpm1229 https://www.mathnet.ru/eng/fpm/v15/i3/p75
|
Statistics & downloads: |
Abstract page: | 471 | Full-text PDF : | 244 | References: | 47 | First page: | 1 |
|