Skip to main content
Article thumbnail
Location of Repository

Efficient Large Numbers Karatsuba-Ofman Multiplier Designs for Embedded Systems

By M. Machhout, M. Zeghid, W. El Hadj Youssef, B. Bouallegue, A. Baganne and R. Tourki

Abstract

Abstract—Long number multiplications (n ≥ 128-bit) are a primitive in most cryptosystems. They can be performed better by using Karatsuba-Ofman technique. This algorithm is easy to parallelize on workstation network and on distributed memory, and it’s known as the practical method of choice. Multiplying long numbers using Karatsuba-Ofman algorithm is fast but is highly recursive. In this paper, we propose different designs of implementing Karatsuba-Ofman multiplier. A mixture of sequential and combinational system design techniques involving pipelining is applied to our proposed designs. Multiplying large numbers can be adapted flexibly to time, area and power criteria. Computationally and occupation constrained in embedded systems such as: smart cards, mobile phones…, multiplication of finite field elements can be achieved more efficiently. The proposed designs are compared to other existing techniques. Mathematical models (Area (n), Delay (n)) of our proposed designs are also elaborated and evaluated on different FPGAs devices. Keywords—finite field, Karatsuba-Ofman, long numbers, multiplication, mathematical model, recursivity. I

Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.308.559
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.waset.org/journals/... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.