Fast binary multiplication by performing dot counting and complement recoding
type: Item
instance of: scholarly article
title: Fast binary multiplication by performing dot counting and complement recoding
zbMATH Open document ID: 1193.68095
author: Chia-Long Wu
author: Der-Chyuan Lou
author: Te-Jen Chang
published in: Applied Mathematics and Computation
publication date: 2010-09-01T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 65Y05
zbMATH DE Number: 5776929
zbMATH Keywords: look-up table
zbMATH Keywords: Hamming weight
zbMATH Keywords: binary multiplication
zbMATH Keywords: complement recoding method
zbMATH Keywords: dots counting method
MaRDI profile type: Publication
full work available at URL: j.amc.2007.02.136
OpenAlex ID: W2042217352
cites work: A method for obtaining digital signatures and public-key cryptosystems
cites work: Modular Multiplication Without Trial Division
cites work: Q4398780
cites work: Fast exponentiation by folding the signed-digit exponent in half
cites work: Carry propagation in signed digit representations
cites work: New methods for binary multiplication
cites work: New iterative algorithms for modular multiplication
cites work: A modified method of a class of recently presented cryptosystems
cites work: Q3379045
cites work: Algorithm of asynchronous binary signed-digit recoding on fast multiexponentiation
DOI: 10.1016/J.AMC.2007.02.136
description: scientific article; zbMATH DE number 5776929