Recommendations
- On complexity and depth of Boolean circuits for multiplication and inversion over finite fields of characteristic 2
- The computational efficacy of finite-field arithmetic
- Inversion in finite fields using logarithmic depth
- An application of the method of additive chains to inversion in finite fields
- The complexity and depth of Boolean circuits for multiplication and inversion in some fields \(\mathrm{GF}(2^{n})\)
Cites work
- scientific article; zbMATH DE number 1583947 (Why is no real title available?)
- scientific article; zbMATH DE number 6004896 (Why is no real title available?)
- scientific article; zbMATH DE number 6004899 (Why is no real title available?)
- scientific article; zbMATH DE number 3121508 (Why is no real title available?)
- scientific article; zbMATH DE number 3873237 (Why is no real title available?)
- scientific article; zbMATH DE number 3880785 (Why is no real title available?)
- scientific article; zbMATH DE number 3928865 (Why is no real title available?)
- scientific article; zbMATH DE number 4012495 (Why is no real title available?)
- scientific article; zbMATH DE number 4064464 (Why is no real title available?)
- scientific article; zbMATH DE number 42045 (Why is no real title available?)
- scientific article; zbMATH DE number 125907 (Why is no real title available?)
- scientific article; zbMATH DE number 176877 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 1246620 (Why is no real title available?)
- scientific article; zbMATH DE number 1254267 (Why is no real title available?)
- scientific article; zbMATH DE number 1349933 (Why is no real title available?)
- scientific article; zbMATH DE number 1042857 (Why is no real title available?)
- scientific article; zbMATH DE number 1052006 (Why is no real title available?)
- scientific article; zbMATH DE number 1144309 (Why is no real title available?)
- scientific article; zbMATH DE number 1942431 (Why is no real title available?)
- scientific article; zbMATH DE number 1962149 (Why is no real title available?)
- scientific article; zbMATH DE number 1979307 (Why is no real title available?)
- scientific article; zbMATH DE number 2077085 (Why is no real title available?)
- scientific article; zbMATH DE number 1759279 (Why is no real title available?)
- scientific article; zbMATH DE number 954401 (Why is no real title available?)
- scientific article; zbMATH DE number 5485560 (Why is no real title available?)
- scientific article; zbMATH DE number 5485562 (Why is no real title available?)
- scientific article; zbMATH DE number 5496852 (Why is no real title available?)
- scientific article; zbMATH DE number 3322464 (Why is no real title available?)
- A GMP-based implementation of Schönhage-Strassen's large integer multiplication algorithm
- A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
- Advances in Cryptology - ASIACRYPT 2003
- Advances in Elliptic Curve Cryptography
- Algebraic complexities and algebraic curves over finite fields
- Algorithmic Number Theory
- An application of the method of additive chains to inversion in finite fields
- An extension of TYT algorithm for GF((2ⁿ)^m) using precomputation
- An implementation for a fast public-key cryptosystem
- An improved parallel algorithm for integer GCD
- Arithmetic operations in \(GF(2^ m)\)
- Complexity of Boolean schemes for arithmetic in some towers of finite fields
- Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten
- Efficient Hardware for the Tate Pairing Calculation in Characteristic Three
- Efficient Modular Arithmetic in Adapted Modular Number System Using Lagrange Representation
- Efficient arithmetic in finite field extensions with application in elliptic curve cryptography.
- Efficient hardware implementation of finite fields with applications to cryptography
- Efficient pairing computation on supersingular abelian varieties
- Fast Algorithms for Manipulating Formal Power Series
- Fast arithmetic with general Gauß periods
- Fast computation of GCDs
- Fast computation of continued fraction expansions.
- Fast multiplication of large numbers
- Fast multiplication of polynomials over fields of characteristic 2
- Fast rectangular matrix multiplication and applications
- Fast solution of toeplitz systems of equations and computation of Padé approximants
- Faster integer multiplication
- Finite field towers: Iterated presentation and complexity of arithmetic.
- Information Security and Privacy
- Inversion in finite fields using logarithmic depth
- Log Depth Circuits for Division and Related Problems
- Low complexity normal bases
- Low complexity normal bases for \(F_{2^{mn}}\)
- Majority Gate Networks
- New upper bounds on the Boolean circuit complexity of symmetric functions
- Normal bases via general Gauss periods
- Number-theoretic algorithms in cryptography. Transl. from the Russian by A. Martsinkovsky
- On Schönhage's algorithm and subquadratic integer gcd computation
- On a quick multiplication in normal bases of finite fields
- On addition chains
- On arithmetical algorithms over finite fields
- On design of circuits of logarithmic depth for inversion in finite fields
- On fast multiplication of polynomials over arbitrary algebras
- On fast multiplication of polynomials, the Fourier and Hartley transforms
- On the Evaluation of Powers
- On the depth of logic circuits for operations in the fields \(\text{GF}(2^n)\)
- On the number of trace-one elements in polynomial bases for \({\mathbb F}_{2^n}\)
- Optimal Size Integer Division Circuits
- Optimal normal bases in \(GF(p^ n)\)
- Optimal tower fields
- Polynomial basis multiplication over \(\text{GF}(2^m)\)
- Remarks on number theory III. On addition chains
- Selected Areas in Cryptography
- Shallow circuits and concise formulae for multiple addition and multiplication
- Sharpening an upper bound on the adder and comparator depths
- Shimura modular curves and asymptotic symmetric tensor rank of multiplication in any finite field
- Subquadratic-time factoring of polynomials over finite fields
- The Computational Complexity of Continued Fractions
- The Solvability of the Derivability Problem for One-Normal Systems
- The complexity and depth of Boolean circuits for multiplication and inversion in some fields \(\mathrm{GF}(2^{n})\)
- Type-II optimal polynomial bases
- Very Fast Parallel Polynomial Arithmetic
Cited in
(16)- A linear algebra attack on the non-commuting cryptography class based on matrix power function
- Complexity of Boolean schemes for arithmetic in some towers of finite fields
- On complexity and depth of Boolean circuits for multiplication and inversion over finite fields of characteristic 2
- scientific article; zbMATH DE number 953031 (Why is no real title available?)
- The computational efficacy of finite-field arithmetic
- Cryptanalysis of schemes based on pseudoinverse matrix
- The complexity of computing all subfields of an algebraic number field
- Cryptanalysis of Cramer-Shoup like cryptosystems based on index exchangeable family
- One-tape Turing machine and branching program lower bounds for MCSP
- scientific article; zbMATH DE number 3861057 (Why is no real title available?)
- Boolean circuits versus arithmetic circuits
- Can a light typing discipline be compatible with an efficient implementation of finite fields inversion?
- A redundant representation of GF(q<sup>n</sup>) for designing arithmetic circuits
- scientific article; zbMATH DE number 429512 (Why is no real title available?)
- scientific article; zbMATH DE number 1866875 (Why is no real title available?)
- Nearly optimal pseudorandomness from hardness
This page was built for publication: Complexity of computation in finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q378003)
