On the complexity of parallel algorithms for computing inverses in \(\text{GF}(2^m)\) with \(m\) prime
From MaRDI portal
Publication:850789
DOI10.1007/s10440-006-9050-5zbMath1101.68107MaRDI QIDQ850789
Publication date: 6 November 2006
Published in: Acta Applicandae Mathematicae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10440-006-9050-5
68Q25: Analysis of algorithms and problem complexity
68W40: Analysis of algorithms
68P25: Data encryption (aspects in computer science)
68W10: Parallel algorithms in computer science
12E30: Field arithmetic
Cites Work