Fast binary multiplication by performing dot counting and complement recoding

DOI10.1016/J.AMC.2007.02.136zbMath1193.68095OpenAlexW2042217352MaRDI QIDQ990410

Te-Jen Chang, Der-Chyuan Lou, Chia-Long Wu

Publication date: 1 September 2010

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2007.02.136

zbMATH Keywords

look-up tableHamming weightbinary multiplicationcomplement recoding methoddots counting method

Mathematics Subject Classification ID

Searching and sorting (68P10) Parallel numerical computation (65Y05)

Related Items (2)

Fast modular multiplication based on complement representation and canonical recoding ⋮ An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation

Cites Work

• Unnamed Item
• Unnamed Item
• New iterative algorithms for modular multiplication
• Carry propagation in signed digit representations
• A modified method of a class of recently presented cryptosystems
• Algorithm of asynchronous binary signed-digit recoding on fast multiexponentiation
• Modular Multiplication Without Trial Division
• A method for obtaining digital signatures and public-key cryptosystems
• Fast exponentiation by folding the signed-digit exponent in half
• New methods for binary multiplication

This page was built for publication: Fast binary multiplication by performing dot counting and complement recoding