Hannes Brunner

Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

EDBT 2026 Demo / reviewers in the wild / expert

dblp:97/1325 · DBLP profile ↗

← Back

1ranked-venue papers

1as first author

0since 2021 · last 1993

—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security 1 paper		Cryptographic primitives and cryptanalysis · 100%
Computer architecture, parallel and distributed computing, and storage systems 1 paper		Processor architecture and microarchitecture · 50% Integrated circuit design · 50%

Topics — the 4 heaviest of 4, each with the papers that count most for it

Topic	Papers	Last	Evidence papers
Cryptographic primitives and cryptanalysis finite field arithmetic	1	1993	On Computing Multiplicative Inverses in GF(2^m) · IEEE Trans. Computers 1993
Cryptographic primitives and cryptanalysis › finite field arithmetic modular inversion	1	1993	On Computing Multiplicative Inverses in GF(2^m) · IEEE Trans. Computers 1993
Processor architecture and microarchitecture computer arithmetic	1	1993	On Computing Multiplicative Inverses in GF(2^m) · IEEE Trans. Computers 1993
Integrated circuit design finite field arithmetic	1	1993	On Computing Multiplicative Inverses in GF(2^m) · IEEE Trans. Computers 1993

Methods — techniques the papers use, named apart from their topics

polynomial GCD · 0.0euclid's algorithm · 0.0

Year	Publication	Venue	Position
1993	On Computing Multiplicative Inverses in GF(2^m) abstract The design of a modular standard basis inversion for Galois fields GF(2/sup m/) based on Euclid's algorithm for computing the greatest common divisor of two polynomials is presented. The asymptotic complexity is linear with m both in computation time and area requirement, thus resulting in an AT-complexity of O(m/sup 2/). This is a significant improvement over the best previous proposal which achieves AT-complexity of only O(m/sup 3/).> Hannes Brunner, Andreas Curiger, Max Hofstetter	IEEE Trans. Computers	1