Computing special powers in finite fields (Q4813594): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalised fast algorithm for computing multiplicative inverses in<i>GF</i>(2<sup>m</sup>) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5533294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient computation of addition chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Addition chains using continued fractions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring a binary polynomial of degree over one million / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in cryptology -- EUROCRYPT '92. Workshop on the theory and applications of cryptographic techniques, Balatonfüred, Hungary, May 24-28, 1992. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On arithmetical algorithms over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Factoring Polynomials Over Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: New directions in cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Sequences with Addition Chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: A public key cryptosystem and a signature scheme based on discrete logarithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal bases via general Gauss periods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal normal bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for exponentiation in finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient and optimal exponentiation in finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227316 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4248250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial factorization over ${\mathbb F}_2$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average order in cyclic groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4470462 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial and normal bases for finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast arithmetic with general Gauß periods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials over finite fields: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2708610 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Frobenius maps and factoring polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5510973 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Fast Exponentiation Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5772619 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective recursive algorithm for computing multiplicative inverses in GF(2m) / 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: Q4695307 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluation of polynomials by computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclid's Algorithm for Large Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3136478 / 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: On the Evaluation of Powers and Monomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Algorithms in Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the length of addition chains / 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: Some Observations on Parallel Algorithms for Fast Exponentiation in $\operatorname{GF}(2^n)$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Complexity of Continued Fractions / rank
 
Normal rank
Property / cites work
 
Property / cites work: VLSI Architectures for Computing Multiplications and Inverses in GF(2<sup>m</sup>) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3142322 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3982564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Evaluation of Powers / rank
 
Normal rank

Latest revision as of 19:49, 6 June 2024

scientific article; zbMATH DE number 2090990
Language Label Description Also known as
English
Computing special powers in finite fields
scientific article; zbMATH DE number 2090990

    Statements

    Computing special powers in finite fields (English)
    0 references
    0 references
    0 references
    13 August 2004
    0 references
    0 references
    exponentiation problem
    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