Improved three-way split formulas for binary polynomial multiplication

DOI10.1007/978-3-642-28496-0_23MaRDI QIDQ2889884zbMATH OpenOpenAlexFDO

Authors Murat Cenk, Christophe Negre, M. Anwar Hasan

Publication date 8 June 2012

Published in Selected Areas in Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-28496-0_23

Mathematics Subject Classification ID

Finite fields and commutative rings (number-theoretic aspects) (11T99) Number-theoretic algorithms; complexity (11Y16) Complexity and performance of numerical algorithms (65Y20) Cryptography (94A60)

Recommendations

• Five, six, and seven-term Karatsuba-like formulae
• Comments on "Five, Six, and Seven-Term Karatsuba-Like Formulae
• A three-term Karatsuba multiplier for a special class of trinomials
• Parallel \(\mathrm{GF}(3^m)\) multiplier for trinomials
• Efficient Multiplication in $\mathbb{F}_{3^{\ell m}}$ , m ≥ 1 and 5 ≤ ℓ ≤ 18

Cites work

• A generalized method for constructing subquadratic complexity GF(2/sup k/) multipliers
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Batch Binary Edwards
• Elliptic Curve Cryptosystems
• scientific article; zbMATH DE number 3688713 (Why is no real title available?)
• scientific article; zbMATH DE number 1042857 (Why is no real title available?)
• scientific article; zbMATH DE number 3322464 (Why is no real title available?)
• Progress in Cryptology - INDOCRYPT 2004

This page was built for publication: Improved three-way split formulas for binary polynomial multiplication

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