Computing special powers in finite fields
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1182964
- Computations with Frobenius Powers
- scientific article; zbMATH DE number 409903
- On the complexity of powering in finite fields
- Algorithms for exponentiation in finite fields
- On special finite fields
- scientific article; zbMATH DE number 1440131
- Computing Square Roots in Finite Fields
- scientific article; zbMATH DE number 1303106
- scientific article; zbMATH DE number 1522535
Cites work
- scientific article; zbMATH DE number 1588465 (Why is no real title available?)
- scientific article; zbMATH DE number 424718 (Why is no real title available?)
- scientific article; zbMATH DE number 446402 (Why is no real title available?)
- scientific article; zbMATH DE number 24470 (Why is no real title available?)
- scientific article; zbMATH DE number 1254267 (Why is no real title available?)
- scientific article; zbMATH DE number 2077085 (Why is no real title available?)
- scientific article; zbMATH DE number 204179 (Why is no real title available?)
- scientific article; zbMATH DE number 3221502 (Why is no real title available?)
- scientific article; zbMATH DE number 3247275 (Why is no real title available?)
- scientific article; zbMATH DE number 3303655 (Why is no real title available?)
- scientific article; zbMATH DE number 3032896 (Why is no real title available?)
- A New Algorithm for Factoring Polynomials Over Finite Fields
- A Survey of Fast Exponentiation Methods
- A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
- A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377
- A lower bound for the length of addition chains
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Addition chains using continued fractions
- Advances in cryptology -- EUROCRYPT '92. Workshop on the theory and applications of cryptographic techniques, Balatonfüred, Hungary, May 24-28, 1992. Proceedings
- Algorithms for exponentiation in finite fields
- Average order in cyclic groups
- Computing Frobenius maps and factoring polynomials
- Computing Sequences with Addition Chains
- Effective recursive algorithm for computing multiplicative inverses in GF(2m)
- Efficient and optimal exponentiation in finite fields
- Efficient computation of addition chains
- Euclid's Algorithm for Large Numbers
- Evaluation of polynomials by computer
- Factoring a binary polynomial of degree over one million
- Factoring polynomials over finite fields: A survey
- Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
- Fast arithmetic with general Gauß periods
- Fast multiplication of large numbers
- Fast multiplication of polynomials over fields of characteristic 2
- Generalised fast algorithm for computing multiplicative inverses inGF(2m)
- Modern computer algebra
- New directions in cryptography
- Normal bases via general Gauss periods
- On arithmetical algorithms over finite fields
- On the Evaluation of Powers
- On the Evaluation of Powers and Monomials
- Optimal normal bases
- Optimal normal bases in \(GF(p^ n)\)
- Polynomial and normal bases for finite fields
- Polynomial factorization over ${\mathbb F}_2$
- Probabilistic Algorithms in Finite Fields
- Some Observations on Parallel Algorithms for Fast Exponentiation in $\operatorname{GF}(2^n)$
- The Computational Complexity of Continued Fractions
- VLSI Architectures for Computing Multiplications and Inverses in GF(2m)
Cited in
(8)- Fast Point Decompression for Standard Elliptic Curves
- Conjecture of two finite fields and its applications
- scientific article; zbMATH DE number 1182964 (Why is no real title available?)
- Related-key attacks against full Hummingbird-2
- Improved generalized Atkin algorithm for computing square roots in finite fields
- Elliptic periods for finite fields
- Computations with Frobenius Powers
- Efficient and optimal exponentiation in finite fields
This page was built for publication: Computing special powers in finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4813594)
