Fast Less Recursive Hardware for Large Number Multiplication Using Karatsuba-Ofman’s Algorithm

  • Nadia Nedjah
  • Luiza de Macedo Mourelle
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2869)


Multiplication of long integers is a cornerstone primitive in most cryptosystems. Multiplication for big numbers can be performed best using Karatsuba-Ofman’s divide-and-conquer approach. Multiplying long integers using Karatsuba-Ofman’s algorithm is fast but the algorithm is highly recursive. We propose a less recursive and efficient hardware architecture for this algorithm. We compare the proposed multiplier to other existing ones.


Smart Card Hardware Architecture Booth Multiplier Operand Size Efficient Hardware Architecture 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    ElGamal, T.: A public-key cryptosystems and signature scheme based on discrete logarithms. IEEE Transactions on Information Theory 31, 469–472 (1985)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Koç, Ç.K.: High speed RSA implementation, Technical report, RSA Laboratories, RSA Data Security Inc. CA, version 2 (1994)Google Scholar
  3. 3.
    Knuth, D.E.: The art of computer programming: seminumerical algorithms, 2nd edn., vol. 2. Addison-Wesley, Reading (1981)zbMATHGoogle Scholar
  4. 4.
    Dhem, J.F.: Design of an efficient public-key cryptographic library for RISC-based smart cards, Ph.D. Thesis, Catholic University of Louvain (1998)Google Scholar
  5. 5.
    Nedjah, N., Mourelle, L.: A reconfigurable recursive and efficient hardware for Karatsuba-Ofman’s multiplication algorithm. In: Proc. of IEEE Conference on Control Applications (2003)Google Scholar
  6. 6.
    Miller, J.F., Job, D., Vassilev, V.K.: Principles in the evolutionary design of digital circuits. Journal of Genetic Programming and Evolvable Machines 1, 259–288 (2000)zbMATHCrossRefGoogle Scholar
  7. 7.
    Xilinx, Inc. Foundation Series Software,
  8. 8.
    Kim, J.H., Ryu, J.H.: A high speed and low power VLSI multiplier using a redundant binary Booth encoding. In: Proc. of Korean Semiconductor Conference, PA-30 (1999)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Nadia Nedjah
    • 1
  • Luiza de Macedo Mourelle
    • 1
  1. 1.Department of Systems Engineering and Computation, Faculty of EngineeringState University of Rio de JaneiroBrazil

Personalised recommendations