Fast digital signature algorithm based on subgraph isomorphism

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4856 LNCS, Issue , 2007, Pages 34-46

  Szollosi, Loránd ^a   Marosits, Tamás ^a   Fehér, Gábor ^a   Recski, András ^a  

^a BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; EMBEDDED SYSTEMS; GRAPH THEORY; PROBLEM SOLVING; SMART CARDS;

DIGITAL SIGNATURE ALGORITHM; SUBGRAPH ISOMORPHISM;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

EID: 38349041778     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-76969-9_3     Document Type: Conference Paper

References (29)

1. Schneier, B.: Applied Cryptography: Protocols, Algorithms, and Source Code in C. John Wiley & Sons, Inc., New York (1993)
2. 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)
3. 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
4. Courtois, N.T., Goubin, L., Patarin, J.: Sflashv3, a fast asymmetric signature scheme. Cryptology ePrint Archive, Report 2003/211 (2003), http://eprint.iacr.org/
5. Gilbert, H., Minier, M.: Cryptanalysis of sflash. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, Springer, Heidelberg (2002)
6. Dubois, V., Fouque, P.A., Shamir, A., Stern, J.: Breaking sflash, http://www.ecrypt.eu.org/webnews/webnews1206.htm#sflash
7. Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge, MA (1990)
8. Merkle, R.C.: A certified digital signature. In: Proceedings on Advances in Cryptology (1989)
9. European Parliament and Council: Directive 1999/93/ec on a community framework for electronic signatures (1999), http://europa.eu.int/ISPO/legal/en/ econunerc/digsig.html http://www.legi-internet.ro/diresignature.htm
10. U.S. House of Representative: Uniform electronic transactions act (UETA), http://vww4.law.cornell.edu/uscode/15/7001.html
11. 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
12. Aaronson, S.: (Complexity zoo), http://qwiki.caltech.edu/wiki/ Complexity_Zoo
13. 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)
14. Levin, L.A., Venkatesan, R.: An average case NP-complete graph problem. Computer Science (2001)
15. Xu, S., Zhu, H., Zhang, G.: Digital signature schemes based on graph isomorphism and graph 3-colorability problems In: Proceedings of CrypTEC 1999
16. 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)
17. Miller, G.: Isomorphism testing for graphs of bounded genus. In: Proceedings of the Twelfth Annual ACM Symposium on Theory of Computing (1980)
18. Luks, E.M.: Isomorphism of graphs of bounded valence can be tested in polynomial time. In: Proceedings of 21st IEEE FOCS Symp. (1980)
19. 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)
20. 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)
21. Dessmark, A., Lingas, A., Proskurowski, A.: Faster algorithms for subgraph isomorphism of k-connected partial k-trees. In: European Symposium on Algorithms (1996)
22. Gupta, A., Nishimura, N.: The complexity of subgraph isomorphism for classes of partial k-trees. tcs 164 (1996)
23. Lingas, A.: Subgraph isomorphism for biconnected outerplanar graphs in cubic time. Theor. Comput. Sci. 63(3) (1989)
24. Hopcroft, J., Tarjan, R.: Efficient planarity testing. J. ACM 21(4), 549-568 (1974)
25. 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)
26. 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)
27. Babai, L.: Automorphism groups, isomorphism reconstruction. In: Graham, R., Grötschel, M., Asz, L.L. (eds.) Handbook of Combinatorics, Elsevier Science, Amsterdam (1995)
28. 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)
29. Biedl, T.: Graph-Theoretic Algorithms. University of Waterloo (2004), http://www.student.cs.uwaterloo.ca/~cs762/Notes/lecture9.ps