Skip to main content

Fast digital signature algorithm based on subgraph isomorphism

Citations of this article
Mendeley users who have this article in their library.
Get full text


A major drawback of nearly all currently existing digital signature schemes is their computational requirements. Fast algorithms exist for PCs or hardware accelerated smart cards, but not for low-end embedded devices which are found in e.g. sensor networks. Such algorithms are also necessary for introduction of inexpensive signature creation devices to the civil sphere. Our purpose is to analyze a class of problems that are based on graph theoretic problems instead of modular arithmetics, and to provide very fast signature creation for embedded systems at the cost of somewhat longer signatures. © Springer-Verlag Berlin Heidelberg 2007.




Szollosi, L., Marosits, T., Fehér, G., & Recski, A. (2007). Fast digital signature algorithm based on subgraph isomorphism. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4856 LNCS, pp. 34–46). Springer Verlag.

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