Remarks on the security of the strong proxy signature scheme with proxy signer privacy protection

  • Authors:
  • Amit K. Awasthi

  • Affiliations:
  • Department of Mathematics, Pranveer Singh Institute of Technology, Bhauti, Kanpur-208020, UP, India

  • Venue:
  • International Journal of Information and Computer Security
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Euclid's Greatest Common Divisor (GCD) algorithm is an efficient approach for calculating multiplicative inversions. It relies mainly on a fast modular arithmetic algorithm to run quickly. A traditional modular arithmetic algorithm based ...