Abstract
We give a review of some works on the complexity of implementation of arithmetic operations in finite fields by Boolean circuits.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
V. B. Afanassiev and A. A. Davydov, “Finite field tower: iterated presentation and complexity of arithmetic,” Finite Fields Appl., 8, 216–232 (2002).
G. B. Agnew, T. Beth, R. C. Mullin, and S. A. Vanstone, “Arithmetic operations in GF(2m),” J. Cryptol., 6, 3–13 (1993).
G. B. Agnew, R. C. Mullin, I. M. Onyszchuk, and S. A. Vanstone, “An implementation for a fast public-key cryptosystem,” J. Cryptol., 3, 63–79 (1991).
O. Ahmadi and A. Menezes, Irreducible Polynomials of Maximum Weight, Preprint (2005).
A. Aho, J. Hopcroft, and J. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading (1974).
D. W. Ash, I. F. Blake, and S. A. Vanstone, “Low complexity normal bases,” Discrete Appl. Math., 25, 191–210 (1989).
A. Avizienis, “Signed-digit number representation for fast parallel arithmetic,” IEEE Trans. Electron. Comput., 10, 389–400 (1961).
D. V. Bailey and C. Paar, “Efficient arithmetic in finite fields extensions with application in elliptic curve cryptography,” J. Cryptol., 14, 153–176 (2001).
J.-C. Bajard, L. Imbert, and T. Plantard, “Modular number systems: Beyond the Mersenne family,” in: SAC’04. 11th Int. Workshop on Selected Areas in Cryptography (2004), pp. 159–169.
S. Baktir, S. Kumar, C. Paar, and B. Sunar, “A state-of-the-art elliptic curve cryptographic processor operating in the frequency domain,” Mobile Networks Appl., 12, No. 4, 259–270 (2007).
S. Baktir, J. Pelzl, T. Wollinger, B. Sunar, and C. Paar, “Optimal tower fields for hyperelliptic curve cryptosystems,” in: Proc. IEEE 38th ACSSC (2004).
S. Baktir and B. Sunar, “Optimal tower fields,” IEEE Trans. Comput., 53, No. 10, 1231–1243 (2004).
S. Baktir and B. Sunar, “Achieving efficient polynomial multiplication in Fermat fields using fast Fourier transform,” in: Proc. ACMSE’06, ACM Press (2006), pp. 549–554.
S. Baktir and B. Sunar, “Frequency domain finite field arithmetic for elliptic curve cryptography,” in: Proc. ISCIS 2006, Lect. Notes Comput. Sci., Vol. 4263, Springer, Berlin (2006), pp. 991–1001.
S. Ballet, J. Chaumine, J. Pieltant, and R. Rolland, On the Tensor Rank of Multiplication in Finite Extensions of Finite Fields, arXiv:1107.1184 (2011).
P. D. Barret, “Implementing the Rivest, Shamir and Adleman public key encryption algorithm on a standard digital signal processor,” in: Advances in Cryptology, Proc. Crypto-86, Lect. Notes Comput. Sci., Vol. 263, Springer, Berlin (1987), pp. 311–323.
P. S. M. L. Barreto, S. Galbraith, C. O’Eigeartaigh, and M. Scott, Efficient Pairing Computation on Supersingular Abelian Varieties, Cryptology ePrint Archive, Report 2004/375, http://eprint.iacr.org/2004/375.
P. S. L. M. Barreto, H. Y. Kim, B. Lynn, and M. Scott, “Efficient algorithms for pairing-based cryptosystems,” in: Proc. Crypto-2002, Lect. Notes Comput. Sci., Vol. 2442, Springer, Berlin (2002), pp. 354–368.
P. Beame, S. Cook, and H. Hoover, “Log depth circuits for division and related problems,” SIAM J. Comput., 15, No. 4, 994–1003 (1986).
D. J. Bernstein, Multidigit Multiplication for Mathematicians, http://cr.yp.to/papers.html#m3 (2004).
D. J. Bernstein, “Batch binary Edwards,” in: S. Halevi, ed., Advances in Cryptology—CRYPTO 2009. 29th Annual Int. Cryptology Conf., Santa Barbara, CA, USA, August 16–20, 2009. Proceedings, Lect. Notes Comput. Sci., Vol. 5677, Springer, Berlin (2009), pp. 317–336.
D. J. Bernstein and T. Lange, “Type-II optimal polynomial bases,” in: Arithmetic of Finite Fields. Third International Workshop, WAIFI 2010, Istanbul, Turkey, June 27–30, 2010. Proceedings, Lect. Notes Comput. Sci., Vol. 6087, Springer, Berlin (2010), pp. 41–61.
G. Bertoni, J. Guajardo, S. Kumar, G. Orlando, C. Paar, and T. Wolinger, “Efficient GF(p m) arithmetic architectures for cryptographic applications,” in: CT-RSA’03 Proc. of the 2003 RSA Conf. on the Cryptographers’ Track, Lect. Notes Comput. Sci., Vol. 2612, Springer, Berlin (2003), pp. 158–175.
R. E. Blahut, Fast Algorithms for Digital Signal Processing, Addison-Wesley, Reading (1985).
I. Blake, R. Roth, and G. Seroussi, Efficient Arithmetic in GF(2n) through Palindromic Representation, Hewlett-Packard, HPL-98-134 (1998).
I. Blake, G. Seroussi, and N. Smart, Elliptic Curves in Cryptography, Cambridge Univ. Press, Cambridge (1999).
I. Blake, G. Seroussi, and N. Smart, Advances in Elliptic Curve Cryptography, Cambridge Univ. Press, Cambridge (2005).
A. A. Bolotov and S. B. Gashkov, “Fast multiplication in normal bases of finite fields,” Discrete Math. Appl., 11, No. 4, 327–356 (2001).
A. A. Bolotov, S. B. Gashkov, and A. B. Frolov, Elementary Introduction in Elliptic Cryptography: Cryptographic Protocols on Elliptic Curves [in Russian], KomKniga, Moscow (2006).
A. A. Bolotov, S. B. Gashkov, A. B. Frolov, and A. A. Chasovskikh, Elementary Introduction in Elliptic Cryptography: Algebraic and Algorithmic Background [in Russian], KomKniga, Moscow (2006).
A. Brauer, “On addition chains,” Bull. Am. Math. Soc., 45, 736–739 (1939).
R. P. Brent, P. Gaudry, E. Thome, and P. Zimmerman, Faster Multiplication in GF(2)[x], Preprint INRIA No. 6359 (2007).
R. Brent, F. Gustavson, and D. Yun, “Fast solution of Toeplitz systems of equations and computation of Padé approximants,” J. Algorithms, 1, 259–295 (1980).
R. Brent and H. Kung, “Fast algorithms for manipulating formal power series,” J. ACM, 25, No. 4, 581–595 (1978).
A. A. Burtzev, “On the circuits for multiplication and inversion in composite fields GF(2n),” Chebyshevskii Sb., 7, No. 1 (17), 172–185 (2006).
A. A. Burtzev, “On the Boolean circuits for multiplication in finite fields of odd characteristics,” in: Proc. VI Sci. School on Discrete Mathematics and Its Applications (Moscow, IPM RAN, April 2007 ) [in Russian], Vol. I (2007), pp. 13–16.
A. A. Burtzev, I. B. Gashkov, and S. B. Gashkov, “On the complexity of Boolean circuits for arithmetic in some towers of finite fields,” Vestn. Mosk. Univ. Ser. 1 Mat. Mekh., No. 5, 10–16 (2006).
A. A. Burtzev and S. B. Gashkov, “On the circuits for arithmetic in composite fields of large characteristic,” Chebyshevskii Sb., 7, No. 1 (17), 186–204 (2006).
D. Canright, A Very Compact Rijndael S-Box, Technical Report NPS-MA-04-001, Naval Postgraduate School, http://library.nps.navy.mil/uhtbin/hyperion-image/NPS-MA-05-001.pdf (2004).
D. Cantor, “On arithmetic algorithms over finite fields,” J. Combin. Theory Ser. A, 50, 285–300 (1989).
D. Cantor and E. Kaltofen, “On fast multiplication of polynomials over arbitrary algebras,” Acta Inform., 28, 693–701 (1991).
K. Chang, H. Kim, J. Kang, and H. Cho, “An extension of TYT algorithm for GF((2n)m) using precomputation,” Inform. Process. Lett., 92, 231–234 (2004).
A. V. Chashkin, “Fast multiplication and addition of integer numbers,” in: Discrete Mathematics and Applications [in Russian], MGU (2001), pp. 91–110.
B. Chor and O. Goldreich, “An improved parallel algorithm for integer GCD,” Algorithmica, 5, 1–10 (1990).
D. V. Chudnovsky and G. V. Chudnovsky, “Algebraic complexities and algebraic curves over finite fields,” J. Complexity, 4, 285–316 (1988).
S. Cook, On the Minimum Computation Time of Functions, Ph.D. Thesis, Harvard Univ. (1966).
A. De, P. P. Kurur, C. Saha, and R. Saptharishi, Fast Integer Multiplication Using Modular Arithmetic, arXiv:0801.1416v2 (2008).
E. Demenkov, A. Kojevnikov, A. S. Kulikov, and G. Yaroslavtsev, “New upper bounds on the Boolean circuit complexity of symmetric functions,” Inform. Process. Lett., 110, 264–267 (2010).
C. Doche, “Redundant trinomials for finite fields of characteristic 2,” in: ACISP 2005, Lect. Notes Comput. Sci., Vol. 3574, Springer, Berlin (2005), pp. 122–133.
P. E. Dunne, The Complexity of Boolean Metworks, Academic Press, London (1988).
I. Duursma and H.-S. Lee, “Tate pairing implementation for hyperelliptic curves y 2 = x p − x + d,” in: Proc. Asiacrypt-2003, Lect. Notes Comput. Sci., Vol. 2894, Springer, Berlin (2003), pp. 111–123.
I. Duursma and H.-S. Lee, Tate Pairing Implementation for Tripartite Key Agreement, Cryptology ePrint Archive, Report 2003/053, http://eprint.iacr.org/2003/053.
W. Eberly, “Very fast parallel polynomial arithmetic,” SIAM J. Comput., 18, No. 5, 955–976 (1989).
S. Erdem, T. Yanik, and C. Koc, “Polynomial basis multiplication over GF(2n),” Acta Appl. Math., 93, 33–55 (2006).
P. Erdős, “Remarks on number theory. III: On addition chains,” Acta Arith., 6, 77–81 (1960).
H. Fan and M. A. Hasan, “Alternative to the Karatsuba algorithm for software implementation of GF(2n) multiplication,” Information Security, IET, 3, No. 2, 60–65 (2009).
S. Feisel, J. von zur Gathen, and M. A. Shokrollahi, “Normal bases via general Gauss periods,” Math. Comput., 68, No. 225, 271–290 (1999).
M. Fürer, “Faster integer multiplication,” in: Proc. 39th ACM STOC 2007 Conf., pp. 57–66.
S. Gao, J. von zur Gathen, and D. Panario, “Gauss periods and fast exponentiation in finite fields,” in: Proc. Latin’95 (Valparaiso, Chile), Lect. Notes Comput. Sci., Vol. 911, Springer, Berlin (1995), pp. 311–322.
S. B. Gashkov, “Remarks on fast polynomial multiplication, Fourier and Hartley transforms,” Diskret. Mat., 12, No. 3, 124–153 (2000).
S. B. Gashkov and V. N. Chubarikov, Arithmetic. Algorithms. Complexity of Computation [in Russian], Nauka, Moscow (1996).
S. B. Gashkov, M. I. Grinchuk, and I. S. Sergeev, “On constructing small depth adders,” Diskret. Anal. Issled. Oper. Ser. 1, 14, No. 1, 27–44 (2007).
S. B. Gashkov and R. A. Khokhlov, “On the depth of logical circuits for operations in fields GF(2n),” Chebyshevskii Sb., 4, No. 4 (8), 59–71 (2003).
S. B. Gashkov and I. S. Sergeev, “An application of the method of addition chains to inversion in finite fields,” Discrete Math. Appl., 16, No. 6, 601–618 (2006).
S. B. Gashkov and I. S. Sergeev, “On constructing circuits of logarithmic depth for inversion in finite fields,” Diskret. Mat., 20, No. 4, 8–28 (2008).
S. B. Gashkov and I. S. Sergeev, “The complexity and depth of Boolean circuits for multiplication and inversion in some fields GF(2n),” Moscow Univ. Math. Bull., 64, No. 4, 139–143 (2009).
S. B. Gashkov and I. S. Sergeev, “On the complexity and the depth of multiplication and inversion in some polynomial rings,” in: Proc. XI Int. Sem. “Discrete Math. and Its Applications” (Moscow, June 2012 ) [in Russian].
J. von zur Gathen, “Inversion in finite fields,” J. Symbol. Comput., 9, 175–183 (1990).
J. von zur Gathen and J. Gerhard, “Arithmetic and factorization of polynomials over GF(2),” in: Proc. ISSAC’96, Zürich (1996), pp. 1–9.
J. von zur Gathen and J. Gerhard, Modern Computer Algebra, Cambridge Univ. Press, Cambridge (1999).
J. von zur Gathen and M. Nöcker, “Exponentiation in finite fields: theory and practice,” in: Applied Algebra. Proc. AAECC-12, Lect. Notes Comput. Sci., Vol. 1255, Springer, Berlin (1997), pp. 88–113.
J. von zur Gathen and M. Nöcker, “Fast arithmetic with general Gauss periods,” Theor. Comput. Sci., 315, 419–452 (2004).
J. von zur Gathen, M. A. Shokrollahy, and J. Shokrollahy, “Efficient multiplication using type 2 optimal normal bases,” in: C. Carlet and B. Sunar, eds., Arithmetic of Finite Fields. First International Workshop, WAIFI 2007, Madrid, Spain, June 21–22, 2007. Proceedings, Lect. Notes Comput. Sci., Vol. 4547, Springer, Berlin (2007), pp. 55–68.
P. Gaudry, A. Kruppa, and P. Zimmermann, “A GMP-based implementation of Schönhage–Strassen’s large integer multiplication algorithm,” in: ISAAC’07, Waterloo, Ontario, Canada, 2007.
R. Granger, D. Page, and M. Stam, “Hardware and software normal basis arithmetic for pairing based cryptography in characteristic three,” IEEE Trans. Comput., 54, No. 7, 852–860 (2005).
M. I. Grinchuk, “Refinement of the upper bound for the depth of adder and comparator,” Diskret. Anal. Issled. Oper. Ser. 1, 15, No. 2, 12–22 (2008).
E. Grove, Proofs with Potential, Ph.D. Thesis, U.C. Berkeley (1993).
J. Guajardo, T. Güneysu, S. Kumar, C. Paar, and J. Pelzl, “Efficient hardware implementation of finite fields with application to cryptography,” Acta Appl. Math., 93, 75–118 (2006).
D. Hankerson, J. H. López, and A. Menezes, “Software implementation of elliptic curve cryptography over binary fields,” in: CHES 2000, Lect. Notes Comput. Sci., Vol. 1965, Springer, Berlin (2000), pp. 1–23.
J. Hastad and T. Leighton, Division in O(log n) Depth Using O(n 1+𝜖) Processors, http://www.nada.kth.se/~yohanh/paraldivision.ps (1986).
X. Huang and V. Pan, “Fast rectangular matrix multiplication and applications,” J. Complexity, 14, 257–299 (1998).
T. Itoh and S. Tsujii, “A fast algorithm for computing multiplicative inverses in GF(2n) using normal bases,” Inform. and Comput., 78, 171–177 (1988).
D. Jungnickel, Finite Fields. Structure and Arithmetic, Wissenschaftsverlag, Mannheim (1993).
E. Kaltofen and V. Shoup, “Subquadratic-time factoring of polynomials over finite fields,” Math. Comput., 67, No. 223, 1179–1197 (1998).
A. A. Karatsuba, “Complexity of computations,” Tr. Mat. Inst. Steklova, 211, 1–17 (1995).
A. A. Karatsuba and Yu. P. Ofman, “Multiplication of multidigit numbers on automata,” Sov. Phys. Dokl., 7, 595–596 (1963).
K. Kedlaya and C. Umans, “Fast modular composition in any characteristic,” in: Proc. 49th IEEE Symp. on Foundations of Computer Science (FOCS) (2008), pp. 146–155.
T. Kerins, W. P. Marnane, E. M. Popovici, and P. S. L. M. Barreto, “Efficient hardware for Tate pairing calculation in characteristic three,” in: Proc. CHES-2005, Lect. Notes Comput. Sci., Vol. 3659, Springer, Berlin (2005), p. 412.
V. M. Khrapchenko, “Asymptotic estimation of addition time of a parallel adder,” Syst. Theory Res., 19, 105–122 (1970).
V. M. Khrapchenko, “Some estimates on the time of multiplication,” Probl. Kibern., 33, 221–227 (1978).
V. M. Khrapchenko, “On possibility of refinement of estimation for delay of parallel adder,” Diskret. Anal. Issled. Oper. Ser. 1, 14, No. 1, 27–44 (2007).
D. Knuth, “The analysis of algorithms,” in: Proc. Int. Congress of Math. (Nice, France), 3, 269–274 (1970).
D. Knuth, The Art of Computer Programming, Addison-Wesley, Reading (1998).
S. Kwon, Efficient Tate Pairing Computation for Supersingular Elliptic Curves over Binary Fields, Cryptology ePrint Archive, Report 2004/303, http://eprint.iacr.org/2004/303.
E. Lee, H.-S. Lee, and Y. Lee, Fast Computation of Tate Pairing on General Divisors for Hyperelliptic Curves of Genus 3, Cryptology ePrint Archive, Report 2006/125, http://eprint.iacr.org/2006/125.
R. Lidl and H. Niederreiter, Finite Fields, Addison-Wesley, Reading (1983).
B. E. Litow and G. I. Davida, “O(log n) parallel time finite field inversion,” in: VLSI Algorithms and Architectures, Lect. Notes Comput. Sci., Vol. 319, Springer, Berlin (1988), pp. 74–80.
O. B. Lupanov, “On rectifier and contact rectifier circuits,” Dokl. Akad. Nauk SSSR, 111, No. 6, 1171–1174 (1956).
O. B. Lupanov, Asymptotic Bounds on Complexity of Control Systems [in Russian], Izd. Mosk. Univ., Moscow (1984).
J. L. Massey and J. K. Omura, Apparatus for Finite Fields Computation, US Patent 4587627 (1986).
E. D. Mastrovito, VLSI Architectures for Computation in Galois Fields, Ph.D. Thesis, Linköping Univ. (1991).
T. Mateer, Fast Fourier Algorithms with Applications, Ph.D. Thesis, Clemson Univ. (2008).
J. H. McClellan and C. M. Rader, Number Theory in Digital Signal Processing, Prentice-Hall, Englewood Cliffs (1979).
A. J. Menezes, P. C. van Oorshot, and S. A. Vanstone, Handbook of Applied Cryptography, CRC Press, Boca Raton (1997).
R. Moenck, “Fast computation of GCDs,” in: Proc. 5th Ann. ACM Symp. on Theory of Computing (1973), pp. 142–151.
N. Möller, “On Sch¨onhhage’s algorithm and subquadratic integer gcd computation,” Math. Comput., 77, 589–607 (2008).
M. Morii and M. Kasahara, “Efficient construction of gate circuit for computing multiplicative inverses in GF(2n),” Trans. IEICE, 72, No. 1, 37–42 (1989).
R. C. Mullin, I. M. Onyszchuk, S. A. Vanstone, and R. M. Wilson, “Optimal normal bases in GF(p n),” Discrete Appl. Math., 22, 149–161 (1988/89).
P. Naudin and C. Quitte, Algorithmique Algébrique, Masson, Paris (1992).
C. Negre and T. Plantard, Prime Field Multiplication in Adapted Modular System Using Lagrange Representation, Preprint (2005).
C. Paar, Effective VLSI Architectures for Bit Parallel Computation in Galois Fields, Ph.D. Thesis, Universität GH Essen (1994).
C. Paar and J. L. Fan, Efficient inversion in tower fields of characteristic two, ISIT, Ulm (1997).
C. Paar, P. Fleischmann, and P. Roelse, “Effective multiplier architectures for Galois fields GF(24n),” IEEE Trans. Comput., 47, No. 2, 162–170 (1998).
C. Paar, P. Fleischmann, and P. Soria-Rodriges, “Fast arithmetic for public-key algorithms in Galois fields with composite exponents,” IEEE Trans. Comput., 48, No. 10, 1025–1034 (1999).
D. Page and N. P. Smart, “Hardware implementation of finite fields of characteristic three,” in: Proc. CHES-2003, pp. 529–539.
M. Paterson, N. Pippenger, and U. Zwick, “Optimal carry save networks,” in: Boolean Function Complexity, London Math. Soc. Lect. Note Ser., Vol. 169, Cambridge Univ. Press, Cambridge (1992), pp. 174–201.
M. Paterson and U. Zwick, “Shallow circuits and concise formulae for multiple addition and multiplication,” Comput. Complexity, 3, 262–291 (1993).
N. P. Red’kin, “Minimal realization of a binary adder,” Probl. Kibern., 38, 181–216 (1981).
J. Reif and S. Tate, “Optimal size integer division circuits,” SIAM J. Comput., 19, No. 5, 912–925 (1990).
A. Reyhani-Masoleh and M. A. Hasan, “On effective normal basis multiplication,” in: Proc. India-CRYPT-2000, Lect. Notes Comput. Sci., Vol. 1977, Springer, Berlin (2000), pp. 213–224.
A. Schönhage, “Schnelle Berechnung von Kettenbruchentwicklungen,” Acta Inform., 1, 139–144 (1971).
A. Schönhage, “Schnelle Multiplikation von Polynomen über Körpern der Charakteristik 2,” Acta Inform., 7, 395–398 (1977).
A. Schönhage and V. Strassen, “Schnelle multiplikation groser Zahlen,” Computing, 7, 271–282 (1971).
J. E. Seguin, “Low complexity normal bases,” Discrete Appl. Math., 28, 309–312 (1990).
I. S. Sergeev, “Circuits of logarithmic depth for inversion in finite fields of characteristic two,” Mat. Vopr. Kibern., 15, 35–64 (2006).
I. S. Sergeev, “On constructing circuits for transitions between polynomial and normal bases in finite fields,” Diskret. Mat., 19, No. 3, 89–101 (2007).
I. S. Sergeev, “On the depth of circuits for multiple addition and multiplication of numbers,” in: Proc. VI Sci. School on Discrete Math. and Its Appl. (Moscow, IPM RAN, April 2007 ) [in Russian], Vol. II (2007), pp. 40–45.
I. E. Shparlinski, M. A. Tsfasman, and S. G. Vladuts, “Curves with many points and multiplication in finite fields,” in: Coding Theory and Algebraic Geometry, Lect. Notes Math., Vol. 1518, Springer, Berlin (1992), pp. 145–169.
D. Stehlé and P. Zimmermann, “A binary recursive GCD algorithm,” in: Proc. ANTS-VI (Burlington, USA, 2004 ), Lect. Notes Comput. Sci., Vol. 3076, Springer, Berlin (2004), pp. 411–425.
G. K. Stolyarov, Method for Parallel Multiplication in Digital Computers and Device for Its Implementation, Author Certificate cl. 42, 14, No. 126668 (1960).
V. Strassen, “Die Berechnungskomplexit¨at von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten,” Numer. Math. 20, 238–251 (1973).
V. Strassen, “The computational complexity of continued fractions,” SIAM J. Comput., 12, 1–27 (1983).
N. Takagi, J. Yoshiki, and K. Takagi, “A fast algorithm for multiplicative inversion in GF(2n) using normal basis,” IEEE Trans. Comput., 50, No. 5, 394–398 (2005).
A. L. Toom, “The complexity of a scheme of functional elements realizing the multiplication of integers,” Sov. Math. Dokl., 3, 714–716 (1963).
C. Umans, “Fast polynomial factorization and modular composition in small characteristic,” in: Proc. 40th Symp. on Theory of Computing (STOC) (2008), pp. 481–490.
O. N. Vasilenko, Number-Theoretic Algorithms in Cryptoraphy [in Russian], MCNMO, Moscow (2007).
C. S. Wallace, “A suggestion for a fast multiplier,” IEEE Trans. Electron. Comput., 13, 14–17 (1964).
I. Wegener, The Complexity of Boolean Functions, Wiley, Stuttgart (1987).
A. C. Yao, “On the evaluation of powers,” SIAM J. Comput., 5, 100–103 (1976).
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 17, No. 4, pp. 95–131, 2011/12.
Rights and permissions
About this article
Cite this article
Gashkov, S.B., Sergeev, I.S. Complexity of computation in finite fields. J Math Sci 191, 661–685 (2013). https://doi.org/10.1007/s10958-013-1350-5
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10958-013-1350-5