Fast digital signature algorithm based on subgraph isomorphism

Authors:
Loránd Szöllösi;Tamás Marosits;Gábor Fehér;András Recski
Affiliations:
Dept. of Telecommunications and Media Informatics, Budapest University of Technology and Economics;Dept. of Telecommunications and Media Informatics, Budapest University of Technology and Economics;Dept. of Telecommunications and Media Informatics, Budapest University of Technology and Economics;Dept. of Computer Science and Information Theory, Budapest University of Technology and Economics
Venue:
CANS'07 Proceedings of the 6th international conference on Cryptology and network security
Year:
2007

Citing 18
Cited 0

Random instances of a graph coloring problem are hard

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Subgraph isomorphism for biconnected outerplanar graphs in cubic time

Theoretical Computer Science
Introduction to algorithms

Introduction to algorithms
Automorphism groups, isomorphism, reconstruction

Handbook of combinatorics (vol. 2)
The complexity of subgraph isomorphism for classes of partial k-trees

Theoretical Computer Science
Faster isomorphism testing of strongly regular graphs

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Efficient Planarity Testing

Journal of the ACM (JACM)
Applied Cryptography: Protocols, Algorithms, and Source Code in C

Applied Cryptography: Protocols, Algorithms, and Source Code in C
A Polynomial-Time Algorithm for Subgraph Isomorphism of Two-Connected Series-Parallel Graphs

ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming
Characterizing the Complexity of Subgraph Isomorphism for Graphs of Bounded Path-Width

STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
A Certified Digital Signature

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Cryptanalysis of SFLASH

EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Faster Algorithms for Subgraph Isomorphism of k-Connected Partial k-Trees

ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Data Dependent Circuit for Subgraph Isomorphism Problem

FPL '02 Proceedings of the Reconfigurable Computing Is Going Mainstream, 12th International Conference on Field-Programmable Logic and Applications
Isomorphism of graphs with bounded eigenvalue multiplicity

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Isomorphism testing for graphs of bounded genus

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
A polynomial-time algorithm for determining the isomorphism of graphs of fixed genus

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Isomorphism of graphs of bounded valence can be tested in polynomial time

SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.