Computing special powers in finite fields
From MaRDI portal
Publication:4813594
DOI10.1090/S0025-5718-03-01599-0zbMath1081.68125MaRDI QIDQ4813594
Joachim von zur Gathen, Michael Nöcker
Publication date: 13 August 2004
Published in: Mathematics of Computation (Search for Journal in Brave)
Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16)
Related Items
Improved generalized Atkin algorithm for computing square roots in finite fields, Related-Key Attacks Against Full Hummingbird-2, Fast Point Decompression for Standard Elliptic Curves, Elliptic periods for finite fields
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Average order in cyclic groups
- Fast arithmetic with general Gauß periods
- Advances in cryptology -- EUROCRYPT '92. Workshop on the theory and applications of cryptographic techniques, Balatonfüred, Hungary, May 24-28, 1992. Proceedings
- Efficient and optimal exponentiation in finite fields
- On arithmetical algorithms over finite fields
- Optimal normal bases in \(GF(p^ n)\)
- A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
- Optimal normal bases
- A lower bound for the length of addition chains
- Fast multiplication of polynomials over fields of characteristic 2
- Efficient computation of addition chains
- Algorithms for exponentiation in finite fields
- Computing Frobenius maps and factoring polynomials
- Polynomial and normal bases for finite fields
- Fast multiplication of large numbers
- Polynomial factorization over ${\mathbb F}_2$
- Evaluation of polynomials by computer
- The Computational Complexity of Continued Fractions
- Some Observations on Parallel Algorithms for Fast Exponentiation in $\operatorname{GF}(2^n)$
- VLSI Architectures for Computing Multiplications and Inverses in GF(2m)
- A public key cryptosystem and a signature scheme based on discrete logarithms
- New directions in cryptography
- On the Evaluation of Powers and Monomials
- Probabilistic Algorithms in Finite Fields
- Computing Sequences with Addition Chains
- A New Algorithm for Factoring Polynomials Over Finite Fields
- On the Evaluation of Powers
- Effective recursive algorithm for computing multiplicative inverses in GF(2m)
- Generalised fast algorithm for computing multiplicative inverses inGF(2m)
- A Survey of Fast Exponentiation Methods
- Normal bases via general Gauss periods
- Addition chains using continued fractions
- A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377
- Factoring a binary polynomial of degree over one million
- Euclid's Algorithm for Large Numbers
- Factoring polynomials over finite fields: A survey
- Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
