Can D.S.A. be improved? — Complexity trade-offs with the digital signature standard —
The Digital Signature Algorithm (DSA) was proposed in 1991 by the US National Institute of Standards and Technology to provide an appropriate core for applications requiring digital signatures. Undoubtedly, many applications will include this standard in the future and thus, the foreseen domination of DSA as a legal certification tool is sufficiently important to focus research endeavours on the suitability of this scheme to various situations.
Performing a quick batch-verification of n signatures. The proposed scheme allows to make the economy of ≈ 450n modular multiplications.
Avoiding the cumbersome calculation of 1 / k mod q by the signer.
Compressing sets of DSA transactions into shorter archive signatures.
Generating signatures from pre-calculated “Use & Throw” 224-bit signature-coupons.
Self-certifying the moduli and bit-patterning directly q on p (gain of 60.4% in key size).
All our schemes combine in a natural way full DSA compatibility and flexible trade-offs between computational complexity, transmission overheads and key sizes.
KeywordsSignature Scheme Modular Multiplication Transmission Overhead Verification Strategy Digital Signature Algorithm
- FIPS PUB XX, February 1, 1993, Digital Signature Standard.Google Scholar
- E. Brickell, D. Gordon and K. McCurley, Fast exponentiation with precomputation, Technical report no. SAND91-1836C, Sandia National Laboratories, Albuquerque, New-Mexico, October 1991.Google Scholar
- E. Brickell and K. McCurley, An interactive identification scheme based on discrete logarithms and factoring, Journal of Cryptology, vol 5, no. 1, 1992.Google Scholar
- D. Chaum and J. Bos, Smart Cash: A practical electronic payment system, CWI-Report CS-R9035, August 1990.Google Scholar
- L. Guillou and J.J. Quisquater, A practical zero-knowledge protocol fitted to security microprocessor minimising both transmission and memory, Advances in cryptology: Proceedings of Eurocrypt'88, LNCS, Springer-Verlag, Berlin, 330, pp 123–128, 1988.Google Scholar
- J.H. Morris, Lambda-calculus models of programming languages, Ph.D. thesis, MIT, 1968.Google Scholar
- C. Schnorr, Efficient identification and signatures for smart-cards, Advances in cryptology: Proceedings of Eurocrypt'89 (G. Brassard ed.), LNCS, Springer-Verlag, Berlin, 435 (1990), pp. 239–252.Google Scholar