Mastrovito multiplier for all trinomials

DOI10.1109/12.769434zbMATH Open1231.68043OpenAlexW2138169871MaRDI QIDQ3417023FDOQ3417023

Authors: Berk Sunar, Çetin Kaya Koç 

Publication date: 9 January 2007

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/bcb2215b71c7143ee047dd7364640b8d3bb80c47

Recommendations

• Mastrovito Form of Non-Recursive Karatsuba Multiplier for All Trinomials
• Mastrovito multiplier for general irreducible polynomials
• Publication:4502657
• A three-term Karatsuba multiplier for a special class of trinomials
• Generalization of a result on the roots of a trinomial equation
• Trace forms of trinomials
• Coefficient multipliers for polynomials
• scientific article; zbMATH DE number 772540
• Multiplicative monomial functions of third degree

zbMATH Keywords

time complexityirreducible trinomialmultiplication in finite fieldsMastrovito multiplier

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Mathematical problems of computer architecture (68M07)

Cited In (13)

• A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers
• Mastrovito Form of Non-Recursive Karatsuba Multiplier for All Trinomials
• Low complexity bit-parallel multiplier for \(\mathbb{F}_{2^n}\) defined by repeated polynomials
• Novel bit-parallel multiplier for \(\mathrm{GF}(2^m)\) defined by all-one polynomial using generalized Karatsuba algorithm
• Title not available (Why is that?)
• On the complexity of parallel algorithms for computing inverses in \(\text{GF}(2^m)\) with \(m\) prime
• Information Security and Cryptology - ICISC 2003
• An extension of TYT inversion algorithm in polynomial basis
• A three-term Karatsuba multiplier for a special class of trinomials
• Reduction-free multiplication for finite fields and polynomial rings
• Low complexity bit parallel multiplier for \(GF(2^m)\) generated by equally-spaced trinomials
• Speedup of bit-parallel Karatsuba multiplier in \(\mathrm{GF}(m^2)\) generated by trinomials
• Polynomial basis multiplication over \(\text{GF}(2^m)\)

This page was built for publication: Mastrovito multiplier for all trinomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3417023)