Fast binary multiplication by performing dot counting and complement recoding
From MaRDI portal
Publication:990410
DOI10.1016/J.AMC.2007.02.136zbMATH Open1193.68095OpenAlexW2042217352MaRDI QIDQ990410FDOQ990410
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
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
- A method for obtaining digital signatures and public-key cryptosystems
- Modular Multiplication Without Trial Division
- Title not available (Why is that?)
- Carry propagation in signed digit representations
- A modified method of a class of recently presented cryptosystems
- New iterative algorithms for modular multiplication
- Algorithm of asynchronous binary signed-digit recoding on fast multiexponentiation
- Fast exponentiation by folding the signed-digit exponent in half
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Reducing the Computation Time in (Short Bit-Width) Two's Complement Multipliers
- Fast Radix-10 Multiplication Using Redundant BCD Codes
- Title not available (Why is that?)
- 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)
