International Association for Cryptologic Research

International Association
for Cryptologic Research

IACR News item: 07 August 2015

Houda Ferradi, R\\\'emi G\\\'eraud, Diana Maimut, David Naccache, Hang Zhou
ePrint Report ePrint Report
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.

Expand

Additional news items may be found on the IACR news page.