A variant of Digital Signature Algorithm

Authors:
Dimitrios Poulakis
Affiliations:
Department of Mathematics, Aristotle University of Thessaloniki, Thessaloniki, Greece 54124
Venue:
Designs, Codes and Cryptography
Year:
2009

Citing 5
Cited 0

A key distribution system equivalent to factoring

Journal of Cryptology
Lattice Attacks on Digital Signature Schemes

Designs, Codes and Cryptography
Handbook of Applied Cryptography

Handbook of Applied Cryptography
On the Security of the Digital Signature Algorithm

Designs, Codes and Cryptography
"Pseudo-Random" Number Generation Within Cryptographic Algorithms: The DDS Case

CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a variant of the Digital Signature Algorithm based on a factorization problem and two discrete logarithm problems. We prove that our signature scheme is at least as secure as the original Digital Signature Algorithm and withstands all known attacks.