Backtracking-assisted multiplication

Houda Ferradi; Rémi Géraud; Diana Maimuţ; David Naccache; Hang Zhou

doi:10.1007/s12095-017-0254-5

Backtracking-assisted multiplication

Houda Ferradi
, Rémi Géraud
, Diana Maimuţ
, David Naccache
, Hang Zhou

PSL research University & IPSL

Research output: Contribution to journal › Article › peer-review

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 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.

Original language	English
Pages (from-to)	17-26
Number of pages	10
Journal	Cryptography and Communications
Volume	10
Issue number	1
DOIs	https://doi.org/10.1007/s12095-017-0254-5
Publication status	Published - 1 Jan 2018

Keywords

Backtracking
Integer arithmetics
Multiplication

Access to Document

10.1007/s12095-017-0254-5

Cite this

@article{39d374d727864e07bb2859660320fb07,

title = "Backtracking-assisted multiplication",

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 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.",

keywords = "Backtracking, Integer arithmetics, Multiplication",

author = "Houda Ferradi and R{\'e}mi G{\'e}raud and Diana Maimu{\c t} and David Naccache and Hang Zhou",

note = "Publisher Copyright: {\textcopyright} 2017, Springer Science+Business Media, LLC.",

year = "2018",

month = jan,

day = "1",

doi = "10.1007/s12095-017-0254-5",

language = "English",

volume = "10",

pages = "17--26",

journal = "Cryptography and Communications",

issn = "1936-2447",

number = "1",

}

TY - JOUR

T1 - Backtracking-assisted multiplication

AU - Ferradi, Houda

AU - Géraud, Rémi

AU - Maimuţ, Diana

AU - Naccache, David

AU - Zhou, Hang

PY - 2018/1/1

Y1 - 2018/1/1

N2 - 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.

AB - 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.

KW - Backtracking

KW - Integer arithmetics

KW - Multiplication

U2 - 10.1007/s12095-017-0254-5

DO - 10.1007/s12095-017-0254-5

M3 - Article

AN - SCOPUS:85041030861

SN - 1936-2447

VL - 10

SP - 17

EP - 26

JO - Cryptography and Communications

JF - Cryptography and Communications

IS - 1

ER -

Backtracking-assisted multiplication

Abstract

Keywords

Access to Document

Fingerprint

Cite this