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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Schneier, B.: Applied Cryptography: Protocols, Algorithms, and Source Code in C. John Wiley & Sons, Inc., New York (1993)
Rivest, R.L., Shamir, A., Adelman, L.M.: A method for obtaining digital signatures and public-key cryptosystems. Technical Report MIT/LCS/TM-82 (1977)
Cooper, D., Santesson, S., Farrell, S., Boeyen, S., Housley, R., Polk, W.: Internet x.509 public key infrastructure certificate and certificate revocation list (crl) profile (internet-draft) (2006), http://www.ietf.org/internet-drafts/draft-ietf-pkix-rfc3280bis-06.txt
Courtois, N.T., Goubin, L., Patarin, J.: Sflashv3, a fast asymmetric signature scheme. Cryptology ePrint Archive, Report 2003/211 (2003), http://eprint.iacr.org/
Gilbert, H., Minier, M.: Cryptanalysis of sflash. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, Springer, Heidelberg (2002)
Dubois, V., Fouque, P.A., Shamir, A., Stern, J.: Breaking sflash, http://www.ecrypt.eu.org/webnews/webnews1206.htm#sflash
Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge, MA (1990)
Merkle, R.C.: A certified digital signature. In: Proceedings on Advances in Cryptology (1989)
European Parliament and Council: Directive 1999/93/ec on a community framework for electronic signatures (1999), http://europa.eu.int/ISPO/legal/en/ecommerc/digsig.html http://www.legi-internet.ro/diresignature.htm
U.S. House of Representative: Uniform electronic transactions act (UETA), http://www4.law.cornell.edu/uscode/15/7001.html
U.S. House of Representative: Electronic signatures in global and national commerce act (e-sign) (2000), http://frwebgate.access.gpo.gov/cgi-bin/getdoc.cgi?dbname106_cong_public_laws&docidf:publ229.106.pdf
Aaronson, S.: (Complexity zoo), http://qwiki.caltech.edu/wiki/Complexity_Zoo
Venkatesan, R., Levin, L.: Random instances of a graph coloring problem are hard. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of computing, ACM Press, New York (1988)
Levin, L.A., Venkatesan, R.: An average case NP-complete graph problem. Computer Science (2001)
Xu, S., Zhu, H., Zhang, G.: Digital signature schemes based on graph isomorphism and graph 3-colorability problems In: Proceedings of CrypTEC 1999
Filotti, I.S., Mayer, J.N.: A polynomial time algorithm for determining isomorphism of graphs of fixed genus. In: Proceedings of the Twelfth Annual ACM Symposium on Theory of Computing (1980)
Miller, G.: Isomorphism testing for graphs of bounded genus. In: Proceedings of the Twelfth Annual ACM Symposium on Theory of Computing (1980)
Luks, E.M.: Isomorphism of graphs of bounded valence can be tested in polynomial time. In: Proceedings of 21st IEEE FOCS Symp. (1980)
Babai, L., Grigoryev, D.Y., Mount, D.M.: Isomorphism of graphs with bounded eigenvalue multiplicity. In: Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing (1982)
Ichikawa, S., Yamamoto, S.: Data dependent circuit for subgraph isomorphism problem. In: Proceedings of 12th Int’l Conf. on Field Programmable Logic and Applications (2002)
Dessmark, A., Lingas, A., Proskurowski, A.: Faster algorithms for subgraph isomorphism of k-connected partial k-trees. In: European Symposium on Algorithms (1996)
Gupta, A., Nishimura, N.: The complexity of subgraph isomorphism for classes of partial k-trees. tcs 164 (1996)
Lingas, A.: Subgraph isomorphism for biconnected outerplanar graphs in cubic time. Theor. Comput. Sci. 63(3) (1989)
Hopcroft, J., Tarjan, R.: Efficient planarity testing. J. ACM 21(4), 549–568 (1974)
Lingas, A., Syslo, M.M.: A polynomial-time algorithm for subgraph isomorphism of two-connected series-parallel graphs. In: Lepistö, T., Salomaa, A. (eds.) Automata, Languages and Programming. LNCS, vol. 317, Springer, Heidelberg (1988)
Gupta, A., Nishimura, N.: Characterizing the complexity of subgraph isomorphism for graphs of bounded path-width. In: Puech, C., Reischuk, R. (eds.) STACS 1996. LNCS, vol. 1046, Springer, Heidelberg (1996)
Babai, L.: Automorphism groups, isomorphism reconstruction. In: Graham, R., Grötschel, M., Asz, L.L. (eds.) Handbook of Combinatorics, Elsevier Science, Amsterdam (1995)
Spielman, D.A.: Faster isomorphism testing of strongly regular graphs. In: STOC 1996: Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, ACM Press, New York (1996)
Biedl, T.: Graph-Theoretic Algorithms. University of Waterloo (2004), http://www.student.cs.uwaterloo.ca/~cs762/Notes/lecture9.ps
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Szőllősi, L., Marosits, T., Fehér, G., Recski, A. (2007). Fast Digital Signature Algorithm Based on Subgraph Isomorphism. In: Bao, F., Ling, S., Okamoto, T., Wang, H., Xing, C. (eds) Cryptology and Network Security. CANS 2007. Lecture Notes in Computer Science, vol 4856. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76969-9_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-76969-9_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-76968-2
Online ISBN: 978-3-540-76969-9
eBook Packages: Computer ScienceComputer Science (R0)