scientific article; zbMATH DE number 2077085
From MaRDI portal
Publication:4470462
zbMath1039.11515MaRDI QIDQ4470462
Joachim von zur Gathen, Michael Nöcker
Publication date: 1 July 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)
Related Items (9)
Efficient hardware implementation of finite fields with applications to cryptography ⋮ Sparse polynomials, redundant bases, Gauss periods, and efficient exponentiation of primitive elements for small characteristic finite fields ⋮ Computing special powers in finite fields ⋮ Complexity of computation in finite fields ⋮ Related-Key Attacks Against Full Hummingbird-2 ⋮ IMPROVEMENT OF THE LOWER BOUND FOR THE COMPLEXITY OF EXPONENTIATION ⋮ Irreducible trinomials over finite fields ⋮ A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers ⋮ Algorithms for exponentiation in finite fields
This page was built for publication:
