Algorithms for exponentiation in finite fields
From MaRDI portal
Publication:1581128
DOI10.1006/jsco.1999.0309zbMath0997.11112OpenAlexW1969341770MaRDI QIDQ1581128
Joachim von zur Gathen, Shuhong Gao, Daniel Panario, Victor Shoup
Publication date: 12 November 2002
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/f27837aadec08e903db1b3847d3a2714e59e36fb
Number-theoretic algorithms; complexity (11Y16) Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30)
Related Items
Fast Pseudorandom Functions Based on Expander Graphs, On the Complexity of the Dual Bases of the Gaussian Normal Bases, Computing special powers in finite fields, GF(2n) Redundant Representation Using Matrix Embedding for Irreducible Trinomials, A class of Gaussian normal bases and their dual bases, Applying quick exponentiation for block upper triangular matrices, Fast arithmetic with general Gauß periods, Finding normal bases over finite fields with prescribed trace self-orthogonal relations, Normal bases from 1-dimensional algebraic groups, The Gaussian normal basis and its trace basis over finite fields, Low complexity normal bases in \(\mathbb F_{2^n}\), Gauss periods as constructions of low complexity normal bases, Irreducible trinomials over finite fields, Complexities of normal bases constructed from Gauss periods, Effective arithmetic in finite fields based on Chudnovsky's multiplication algorithm, On finite field arithmetic in characteristic 2, A quick exponentiation algorithm for \(3\times 3\) block upper triangular matrices, Abelian groups, Gauss periods, and normal bases, Efficient computation of roots in finite fields, A note on the multiple-recursive matrix method for generating pseudorandom vectors, Subquadratic-time algorithms for normal bases, Elliptic periods for finite fields, Probabilistic algorithm for finding roots of linearized polynomials, Construction of self-dual normal bases and their complexity, On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry, The GN-authenticated key agreement, Arithmetic in finite fields based on the Chudnovsky-Chudnovsky multiplication algorithm
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient and optimal exponentiation in finite fields
- On arithmetical algorithms over finite fields
- Matrix multiplication via arithmetic progressions
- Low complexity normal bases
- Optimal normal bases in \(GF(p^ n)\)
- On fast multiplication of polynomials over arbitrary algebras
- Optimal normal bases
- Advances in cryptology - EUROCRYPT '88. Workshop on the theory and application of cryptographic techniques, Davos, Switzerland, May 25--27, 1988. Proceedings
- Fast multiplication of polynomials over fields of characteristic 2
- Orders of Gauss periods in finite fields
- An implementation for a fast public-key cryptosystem
- Gaussian elimination is not optimal
- Fast multiplication of large numbers
- Some Observations on Parallel Algorithms for Fast Exponentiation in $\operatorname{GF}(2^n)$
- Self-Complementary Normal Bases in Finite Fields
- Factoring with Cyclotomic Polynomials
- Bit-serial Reed - Solomon encoders
- Fast Algorithms for Manipulating Formal Power Series
- Gauss periods: orders and cryptographical applications
- Subquadratic-time factoring of polynomials over finite fields
- On Orders of Optimal Normal Basis Generators
