Improving multiplication and reminder using implementation based on word and index

  • Authors:
  • Najmeh Danesh;Malihe Danesh;Hossein Shirgahi;Abbas Ghaemi B.

  • Affiliations:
  • Islamic Azad University, Sari Branch, Sari, Iran;Ferdowsi University of Mashhad, Mashhad, Iran;Islamic Azad University, Jouybar Branch, jouybar, Iran;Ferdowsi University of Mashhad, Mashhad, Iran

  • Venue:
  • Proceedings of the 1st Amrita ACM-W Celebration on Women in Computing in India
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

asynchronous cryptography is one of the most widely used cryptographic algorithms. Much research has been done to find other applications of this cryptography method. Modular exponentiation is one of the primitive operations in these algorithms. Since we need to perform multiplication, square and modular division, most aspects of these studies were based on optimizing each of these algorithms. Since access to faster software or hardware techniques was the objective of these studies, after studying optimized implementation methods of multiplication and division, we tried to take a step toward the application of methods of software implementation of some examples to decrease implementation time and increase the efficiency of algorithms of this type in this paper.