Backtracking-assisted multiplication

DOI10.1007/S12095-017-0254-5MaRDI QIDQ680916zbMATH OpenOpenAlexFDO

Authors Houda Ferradi, Rémi Géraud, Diana Maimut, David Naccache, Hang Zhou

Publication date 29 January 2018

Published in Cryptography and Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s12095-017-0254-5

zbMATH Keywords

multiplicationbacktrackinginteger arithmetics

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Cryptography (94A60) Mathematical problems of computer architecture (68M07)

Recommendations

• scientific article; zbMATH DE number 3291609
• Toward the concept of backtracking computation
• An Algorithm for Multiplication in Modular Arithmetic
• The complexity of iterated multiplication
• Solving multiplicative programs by binary-encoding the multiplication operation
• Even faster integer multiplication
• scientific article; zbMATH DE number 1294069
• Extended Euclid's Algorithm via Backward Recurrence Relations

Cites work

• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• scientific article; zbMATH DE number 3322464 (Why is no real title available?)
• Closed-form expression for the average weight of signed-digit representations
• Constant integer multiplication using minimum adders
• Even faster integer multiplication
• Fast multiplication of large numbers
• Faster integer multiplication
• Modular Multiplication Without Trial Division
• New directions in cryptography
• On Computing Logarithms Over Finite Fields
• Some complexity issues in digital signal processing
• Zero-knowledge proofs of identity

Cited in

(1)

• Operational framework for recent advances in backtracking search optimisation algorithm: a systematic review and performance evaluation

This page was built for publication: Backtracking-assisted multiplication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q680916)