Paper 2015/787

Backtracking-Assisted Multiplication

Houda Ferradi, Rémi Géraud, Diana Maimut, 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)
PDF
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
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2015/787,
      author = {Houda Ferradi and Rémi Géraud and Diana Maimut and David Naccache and Hang Zhou},
      title = {Backtracking-Assisted Multiplication},
      howpublished = {Cryptology ePrint Archive, Paper 2015/787},
      year = {2015},
      note = {\url{https://eprint.iacr.org/2015/787}},
      url = {https://eprint.iacr.org/2015/787}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.