You are looking at a specific version 20150807:141511 of this paper.
See the latest version.
Paper 2015/787
Backtracking-Assisted Multiplication
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.
Metadata
- Available format(s)
- Category
- Implementation
- Publication info
- Preprint. MINOR revision.
- Keywords
- multiplicationarithmetic for cryptography
- Contact author(s)
- david naccache @ ens fr
- History
- 2015-08-07: received
- Short URL
- https://ia.cr/2015/787
- License
-
CC BY