Cryptology ePrint Archive: Report 2015/787
Houda Ferradi and Rémi Géraud and Diana Maimut and David Naccache and Hang Zhou
Abstract: This paper describes a new multiplication algorithm, particularly
suited to lightweight microprocessors when one of the operands is
known in advance. The method uses backtracking to find a multiplicationfriendly encoding of the operand known in advance.
A 68HC05 microprocessor implementation shows that the new algorithm
indeed yields a twofold speed improvement over classical multiplication for 128-byte numbers.
Category / Keywords: implementation / multiplication, arithmetic for cryptography
Date: received 6 Aug 2015
Contact author: david naccache at ens fr
Available format(s): PDF | BibTeX Citation
Version: 20150807:141511 (All versions of this report)
Short URL: ia.cr/2015/787
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]