Backtracking-assisted multiplication

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 multiplication-friendly encoding of the operand known in advance. A 68hc05 microprocessor implementation shows...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Cryptography and communications 2018, Vol.10 (1), p.17-26
Hauptverfasser:	Ferradi, Houda, Géraud, Rémi, Maimuţ, Diana, Naccache, David, Zhou, Hang
Format:	Artikel
Sprache:	eng
Schlagworte:	Circuits Coding and Information Theory Communications Engineering Computer Science Data Structures and Information Theory Information and Communication Mathematics of Computing Microprocessors Multiplication Multiplication & division Networks Recent Trends in Cryptography
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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 multiplication-friendly 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.
ISSN:	1936-2447 1936-2455
DOI:	10.1007/s12095-017-0254-5