Efficient randomized generation of optimal algorithms for multiplication in certain finite fields
From MaRDI portal
Publication:1198957
DOI10.1007/BF01276439zbMath0755.11039MaRDI QIDQ1198957
Publication date: 16 January 1993
Published in: Computational Complexity (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16) Parallel algorithms in computer science (68W10) Elliptic curves (14H52)
Cites Work
- Unnamed Item
- Unnamed Item
- On the rank of certain finite fields
- Lectures on the complexity of bilinear problems
- Factoring integers with elliptic curves
- An optimal algorithm for multiplication in \(\mathbb{F}_{256}/\mathbb{F}_ 4\)
- On multiplication in algebraic extension fields
- Lectures on the theory of algebraic functions of one variable
- Elliptic Curves and Primality Proving
- Characterization of Division Algebras of Minimal Rank and the Structure of their Algorithm Varieties
- Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
- A simple and fast probabilistic algorithm for computing square roots modulo a prime number (Corresp.)
- Probabilistic Algorithms in Finite Fields
- Formal groups arising from algebraic varieties
- Abelian varieties over finite fields
- A note on square roots in finite fields
- Algebraic complexities and algebraic curves over finite fields
This page was built for publication: Efficient randomized generation of optimal algorithms for multiplication in certain finite fields
