Polynomial basis multiplication over \(\text{GF}(2^m)\)
From MaRDI portal
Publication:850783
DOI10.1007/s10440-006-9047-0zbMath1108.11089MaRDI QIDQ850783
Serdar S. Erdem, Tuğrul Yanık, Çetin Kaya Koç
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-9047-0
finite fields; binary fields; polynomial basis; Montgomery multiplication; modular multiplication; matrix reduction
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
68P25: Data encryption (aspects in computer science)
11Y16: Number-theoretic algorithms; complexity
68M07: Mathematical problems of computer architecture
Related Items
Complexity of computation in finite fields, On the arithmetic operations over finite fields of characteristic three with low complexity, Low complexity bit-parallel multiplier for \(\mathbb{F}_{2^n}\) defined by repeated polynomials, A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers
Cites Work
- Unnamed Item
- Unnamed Item
- Structure of parallel multipliers for a class of fields \(GF(2^ m)\)
- Montgomery multiplication in \(\text{GF}(2^ k)\)
- Mastrovito multiplier for all trinomials
- Bit-parallel finite field multiplier and squarer using polynomial basis
- Montgomery multiplier and squarer for a class of finite fields
- Low complexity bit-parallel multipliers for a class of finite fields
