On the complexity of parallel algorithms for computing inverses in \(\text{GF}(2^m)\) with \(m\) prime

DOI10.1007/s10440-006-9050-5zbMath1101.68107OpenAlexW2035724794MaRDI QIDQ850789

Michele Elia, M. Leone

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Data encryption (aspects in computer science) (68P25) Parallel algorithms in computer science (68W10) Field arithmetic (12E30)

Cites Work

• Theoretical computer science. Cumulative index, volumes 1-100 (1992)
• The Scholz-Brauer problem on addition chains
• Mastrovito multiplier for all trinomials
• Computing the reciprocal of units in Galois rings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the complexity of parallel algorithms for computing inverses in \(\text{GF}(2^m)\) with \(m\) prime