ISSN:
1432-1378
Keywords:
Digital signatures
;
Public-key signatures
;
Public-key authentication
;
ElGamal signatures
;
Discrete logarithm one-way function
;
Signatures with preprocessing
;
Random exponentiated residues
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
Notes:
Abstract We present a new public-key signature scheme and a corresponding authentication scheme that are based on discrete logarithms in a subgroup of units in ℤ p where p is a sufficiently large prime, e.g., p ≥ 2512. A key idea is to use for the base of the discrete logarithm an integer α in ℤ p such that the order of α is a sufficiently large prime q, e.g., q ≥ 2140. In this way we improve the ElGamal signature scheme in the speed of the procedures for the generation and the verification of signatures and also in the bit length of signatures. We present an efficient algorithm that preprocesses the exponentiation of a random residue modulo p.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF00196725
Permalink
