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 that the new algorithm indeed yields a twofold speed improvement over classical multiplication for 128-byte numbers.

[1]  Taher ElGamal.  On Computing Logarithms Over Finite Fields , 1985 .

[2]  David Thomas,et al.  The Art in Computer Programming , 2001 .

[3]  Arnold Schönhage,et al.  Schnelle Multiplikation großer Zahlen , 1971, Computing.

[4]  Andrew G. Dempster,et al.  Use of multiplier blocks to reduce filter complexity , 1994, Proceedings of IEEE International Symposium on Circuits and Systems - ISCAS '94.

[5]  Taher El Gamal.  A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, IEEE Trans. Inf. Theory.

[6]  K. Steiglitz,et al.  Some complexity issues in digital signal processing , 1984 .

[7]  A. Avizeinis,et al.  Signed Digit Number Representations for Fast Parallel Arithmetic , 1961 .

[8]  Amos Fiat,et al.  Zero Knowledge Proofs of Identity , 1987, STOC.

[9]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[10]  Amos Fiat,et al.  Zero-knowledge proofs of identity , 1987, Journal of Cryptology.

[11]  S. Cook,et al.  ON THE MINIMUM COMPUTATION TIME OF FUNCTIONS , 1969 .

[12]  A. Dempster,et al.  Constant integer multiplication using minimum adders , 1994 .

[13]  T. Elgamal.  A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, CRYPTO 1984.

[14]  Joris van der Hoeven,et al.  Even faster integer multiplication , 2014, J. Complex..

[15]  P. L. Montgomery.  Modular multiplication without trial division , 1985 .

[16]  M. Anwar Hasan,et al.  Closed-Form Expression for the Average Weight of Signed-Digit Representations , 1999, IEEE Trans. Computers.

[17]  A. Dempster,et al.  Use of minimum-adder multiplier blocks in FIR digital filters , 1995 .

[18]  Algirdas Avizienis,et al.  Signed-Digit Numbe Representations for Fast Parallel Arithmetic , 1961, IRE Trans. Electron. Comput..

[19]  Paul Barrett,et al.  Implementing the Rivest Shamir and Adleman Public Key Encryption Algorithm on a Standard Digital Signal Processor , 1986, CRYPTO.

[20]  Robert L. Bernstein.  Multiplication by integer constants , 1986, Softw. Pract. Exp..

[21]  Martin Fürer,et al.  Faster integer multiplication , 2007, STOC '07.