An application of the method of additive chains to inversion in finite fields
From MaRDI portal
Publication:5424089
DOI10.1515/156939206779217952zbMath1140.11061OpenAlexW2022970431MaRDI QIDQ5424089
Sergey B. Gashkov, Igor S. Sergeev
Publication date: 2 November 2007
Published in: Discrete Mathematics and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/156939206779217952
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Analytic circuit theory (94C05) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Related Items (7)
On design of circuits of logarithmic depth for inversion in finite fields ⋮ Rectifier Circuits of Bounded Depth ⋮ Complexity of computation in finite fields ⋮ Fast algorithms for solving equations of degree \(\le 4\) in some finite fields ⋮ Fast algorithm of square rooting in some finite fields of odd characteristic ⋮ IMPROVEMENT OF THE LOWER BOUND FOR THE COMPLEXITY OF EXPONENTIATION ⋮ The complexity and depth of Boolean circuits for multiplication and inversion in some fields \(\mathrm{GF}(2^{n})\)
Cites Work
This page was built for publication: An application of the method of additive chains to inversion in finite fields
