A digital signature based on a conventional encryption function

893Citations
Citations of this article
501Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A new digital signature based only on a conventional encryption function (such as DES) is described which is as secure as the underlying encryption function -- the security does not depend on the difficulty of factoring and the high computational costs of modular arithmetic are avoided. The signature system can sign an unlimited number of messages, and the signature size increases logarithmically as a function of the number of messages signed. Signature size in a ‘typical’ system might range from a few hundred bytes to a few kilobytes, and generation of a signature might require a few hundred to a few thousand computations of the underlying conventional encryption function.

Cite

CITATION STYLE

APA

Merkle, R. C. (1988). A digital signature based on a conventional encryption function. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 293 LNCS, pp. 369–378). Springer Verlag. https://doi.org/10.1007/3-540-48184-2_32

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free