Quick verification of RSA signatures

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Speeding up RSA signature authentication is important in various scenarios. We propose here a scheme for quick verification of RSA signatures, that is mostly appropriate when the public exponent is small. This scheme pre-computes the quotients required to perform modular reduction during verification, and includes them as part of the certificate that is being authenticated. This allows for replacing expensive modular reduction steps by less costly integer multiplications and subtractions. As a result, the scheme achieves significant speedup as well as reduction in the code size and complexity. The quotients are computed using only the public key and the signature, and do not need to involve the signing procedure, nor require any changes in it. The verification scheme that uses these quotients as part of a quick verification flow is no weaker than the cryptographic primitive on which the signature scheme is based. The performance results that are reported in the paper demonstrate the advantage of the proposed scheme.

Original languageAmerican English
Title of host publicationProceedings - 2011 8th International Conference on Information Technology
Subtitle of host publicationNew Generations, ITNG 2011
PublisherIEEE Computer Society
Pages382-386
Number of pages5
ISBN (Print)9780769543673
DOIs
StatePublished - 2011

Publication series

NameProceedings - 2011 8th International Conference on Information Technology: New Generations, ITNG 2011

Keywords

  • RSA
  • fast implementation

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Information Systems

Fingerprint

Dive into the research topics of 'Quick verification of RSA signatures'. Together they form a unique fingerprint.

Cite this