Backtracking-assisted multiplication

DOI10.1007/s12095-017-0254-5zbMath1384.68008OpenAlexW2403291794MaRDI QIDQ680916

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

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)

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Even faster integer multiplication
• Zero-knowledge proofs of identity
• Fast multiplication of large numbers
• Modular Multiplication Without Trial Division
• Faster Integer Multiplication
• Some complexity issues in digital signal processing
• On Computing Logarithms Over Finite Fields
• New directions in cryptography
• Constant integer multiplication using minimum adders
• Closed-form expression for the average weight of signed-digit representations

This page was built for publication: Backtracking-assisted multiplication