Complexity of computation in finite fields (Q378003): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10958-013-1350-5 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Finite field towers: Iterated presentation and complexity of arithmetic. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arithmetic operations in \(GF(2^ m)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: An implementation for a fast public-key cryptosystem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of trace-one elements in polynomial bases for \({\mathbb F}_{2^n}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low complexity normal bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient arithmetic in finite field extensions with application in elliptic curve cryptography. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selected Areas in Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal tower fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shimura Modular Curves and Asymptotic Symmetric Tensor Rank of Multiplication in any Finite Field / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient pairing computation on supersingular abelian varieties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4409129 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Log Depth Circuits for Division and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Type-II Optimal Polynomial Bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418534 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3703780 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4265362 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Elliptic Curve Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a quick multiplication in normal bases of finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: On addition chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast solution of toeplitz systems of equations and computation of Padé approximants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Manipulating Formal Power Series / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3499664 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5504795 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On arithmetical algorithms over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: On fast multiplication of polynomials over arbitrary algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of TYT algorithm for \(GF((2^n)^m)\) using precomputation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved parallel algorithm for integer GCD / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic complexities and algebraic curves over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Solvability of the Derivability Problem for One-Normal Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5302073 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New upper bounds on the Boolean circuit complexity of symmetric functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information Security and Privacy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994882 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - ASIACRYPT 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Very Fast Parallel Polynomial Arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial basis multiplication over \(\text{GF}(2^m)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks on number theory III. On addition chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal bases via general Gauss periods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549597 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226694 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On fast multiplication of polynomials, the Fourier and Hartley transforms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4384378 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115628 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5472004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of the method of additive chains to inversion in finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: On design of circuits of logarithmic depth for inversion in finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity and depth of Boolean circuits for multiplication and inversion in some fields \(\mathrm{GF}(2^{n})\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inversion in finite fields using logarithmic depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227316 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4470462 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast arithmetic with general Gauß periods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5301666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115681 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient hardware implementation of finite fields with applications to cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536202 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast rectangular matrix multiplication and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subquadratic-time factoring of polynomials over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4346406 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Hardware for the Tate Pairing Calculation in Characteristic Three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115631 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4349924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3798224 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3236503 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3346383 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4718481 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast computation of GCDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Schönhage's algorithm and subquadratic integer gcd computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal normal bases in \(GF(p^ n)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Modular Arithmetic in Adapted Modular Number System Using Lagrange Representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4425740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4036708 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shallow circuits and concise formulae for multiple addition and multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3340780 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Size Integer Division Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2707608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast computation of continued fraction expansions. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast multiplication of polynomials over fields of characteristic 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast multiplication of large numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low complexity normal bases for \(F_{2^{mn}}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4027646 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Number Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Complexity of Continued Fractions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5601777 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5302071 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3419881 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Majority Gate Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3762226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Evaluation of Powers / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10958-013-1350-5 / rank
 
Normal rank

Latest revision as of 15:45, 9 December 2024

scientific article
Language Label Description Also known as
English
Complexity of computation in finite fields
scientific article

    Statements

    Complexity of computation in finite fields (English)
    0 references
    0 references
    0 references
    20 November 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references