Computing special powers in finite fields (Q4813594)

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

instance of

scholarly article

0 references

title

Computing special powers in finite fields (English)

0 references

author

Joachim von zur Gathen

0 references

Michael Nöcker

0 references

published in

Mathematics of Computation

0 references

publication date

13 August 2004

0 references

zbMATH Keywords

exponentiation problem

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Generalised fast algorithm for computing multiplicative inverses inGF(2m)

0 references

Q5533294

0 references

Efficient computation of addition chains

0 references

Addition chains using continued fractions

0 references

Factoring a binary polynomial of degree over one million

0 references

A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377

0 references

Advances in cryptology -- EUROCRYPT '92. Workshop on the theory and applications of cryptographic techniques, Balatonfüred, Hungary, May 24-28, 1992. Proceedings

0 references

Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers

0 references

On arithmetical algorithms over finite fields

0 references

A New Algorithm for Factoring Polynomials Over Finite Fields

0 references

New directions in cryptography

0 references

Computing Sequences with Addition Chains

0 references

A public key cryptosystem and a signature scheme based on discrete logarithms

0 references

Normal bases via general Gauss periods

0 references

Optimal normal bases

0 references

Algorithms for exponentiation in finite fields

0 references

Efficient and optimal exponentiation in finite fields

0 references

Q4227316

0 references

Q4248250

0 references

Polynomial factorization over ${\mathbb F}_2$

0 references

Average order in cyclic groups

0 references

Q4470462

0 references

Polynomial and normal bases for finite fields

0 references

Fast arithmetic with general Gauß periods

0 references

Factoring polynomials over finite fields: A survey

0 references

Q2708610

0 references

Computing Frobenius maps and factoring polynomials

0 references

Q5510973

0 references

A Survey of Fast Exponentiation Methods

0 references

Q5772619

0 references

Effective recursive algorithm for computing multiplicative inverses in GF(2m)

0 references

A fast algorithm for computing multiplicative inverses in $\text{GF}(2^ m)$ using normal bases

0 references

Q4695307

0 references

Evaluation of polynomials by computer

0 references

Q5585021

0 references

Euclid's Algorithm for Large Numbers

0 references

Q3136478

0 references

Optimal normal bases in $GF(p^ n)$

0 references

On the Evaluation of Powers and Monomials

0 references

Probabilistic Algorithms in Finite Fields

0 references

A lower bound for the length of addition chains

0 references

Fast multiplication of polynomials over fields of characteristic 2

0 references

Fast multiplication of large numbers

0 references

Some Observations on Parallel Algorithms for Fast Exponentiation in $\operatorname{GF}(2^n)$

0 references

The Computational Complexity of Continued Fractions

0 references

VLSI Architectures for Computing Multiplications and Inverses in GF(2m)

0 references

Q3142322

0 references

Q3982564

0 references

On the Evaluation of Powers

0 references

Identifiers

zbMATH Open document ID

1081.68125

0 references

DOI

10.1090/S0025-5718-03-01599-0

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4813594