• DocumentCode
    1391198
  • Title

    Batch verifying multiple DSA-type digital signatures

  • Author

    Harn, L.

  • Author_Institution
    Dept. of Comput. Networking, Missouri Univ., Kansas City, MO, USA
  • Volume
    34
  • Issue
    9
  • fYear
    1998
  • fDate
    4/30/1998 12:00:00 AM
  • Firstpage
    870
  • Lastpage
    871
  • Abstract
    The digital signature standard proposed by the US government in 1991 is an ElGamal-type signature scheme based on the discrete logarithm problem. Since verifying each ElGamal-type signature requires at least two modular exponentiations, and modular exponentiation is a computationally intensive operation, it becomes desirable to use special purpose hardware or an efficient software algorithm to speed up the signature verification process. The author proposes efficient and secure algorithms to verify multiple digital signatures based on the discrete logarithm. Instead of verifying each individual signature separately. It is proposed to verify multiple signatures simultaneously. The proposed batch verification algorithm can maintain a constant verification time to verify a single signature
  • Keywords
    public key cryptography; standards; ElGamal-type signature scheme; batch verification algorithm; constant verification time; discrete logarithm problem; modular exponentiation; multiple DSA-type digital signatures; signature verification process; software algorithm;
  • fLanguage
    English
  • Journal_Title
    Electronics Letters
  • Publisher
    iet
  • ISSN
    0013-5194
  • Type

    jour

  • DOI
    10.1049/el:19980620
  • Filename
    682819