Fast binary multiplication by performing dot counting and complement recoding

DOI10.1016/J.AMC.2007.02.136MaRDI QIDQ990410zbMATH OpenOpenAlexFDO

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

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

Hamming weightbinary multiplicationcomplement recoding methoddots counting methodlook-up table

Mathematics Subject Classification ID

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

Recommendations

• New methods for binary multiplication
• Fast modular multiplication based on complement representation and canonical recoding
• Inefficiency of common-multiplicand multiplication and exponentiation algorithms by performing binary complements
• Fast one's-complement multiplication
• Fast algorithms for implemention of Montgomery's modular multiplication technique

Cites work

• scientific article; zbMATH DE number 5017575 (Why is no real title available?)
• scientific article; zbMATH DE number 1178976 (Why is no real title available?)
• A method for obtaining digital signatures and public-key cryptosystems
• A modified method of a class of recently presented cryptosystems
• Algorithm of asynchronous binary signed-digit recoding on fast multiexponentiation
• Carry propagation in signed digit representations
• Fast exponentiation by folding the signed-digit exponent in half
• Modular Multiplication Without Trial Division
• New iterative algorithms for modular multiplication
• New methods for binary multiplication

Cited in

(8)

• New methods for binary multiplication
• Fast modular multiplication based on complement representation and canonical recoding
• An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation
• scientific article; zbMATH DE number 5708383 (Why is no real title available?)
• Reducing the Computation Time in (Short Bit-Width) Two's Complement Multipliers
• Fast Radix-10 Multiplication Using Redundant BCD Codes
• scientific article; zbMATH DE number 3223196 (Why is no real title available?)
• Fast Bit-Parallel Binary Multipliers Based on Type-I Pentanomials

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

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