Proper Key Generation for the IzoSign Algorithm

In the last decade using digital signatures in authentication and authorization protocols just as in e-business scenarios became more and more important and indispensable. New algorithms with different features for various applications are presented continuously. The IzoSign digital signature creation algorithm was introduced by the authors of this paper at CANS 2007. At that time, random key generation was proposed, which was later found vulnerable with high probability to a vertex matching attack (Kutylowski, 2007). We hereby analyze and generalize this kind of attacks, build a key generation algorithm that withstands such attacks, and then give a (theoretic) construction for key generation which (under the P 6= NP or NP= EXPassumptions)

[1]  Andrzej Lingas,et al.  Faster Algorithms for Subgraph Isomorphism of k-Connected Partial k-Trees , 1996, ESA.

[2]  Matthieu Finiasz,et al.  How to Achieve a McEliece-Based Digital Signature Scheme , 2001, ASIACRYPT.

[3]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[4]  Naomi Nishimura,et al.  Characterizing the Complexity of Subgraph Isomorphism for Graphs of Bounded Path-Width , 1996, STACS.

[5]  Eugene M. Luks Isomorphism of Graphs of Bounded Valence Can Be Tested in Polynomial Time , 1980, FOCS.

[6]  I. S. Filotti,et al.  A polynomial-time algorithm for determining the isomorphism of graphs of fixed genus , 1980, STOC '80.

[7]  Gábor Fehér,et al.  Fast Digital Signature Algorithm Based on Subgraph Isomorphism , 2007, CANS.

[8]  David M. Mount,et al.  Isomorphism of graphs with bounded eigenvalue multiplicity , 1982, STOC '82.

[9]  Shoji Yamamoto,et al.  Data Dependent Circuit for Subgraph Isomorphism Problem , 2002, FPL.

[10]  Ralph C. Merkle,et al.  A Certified Digital Signature , 1989, CRYPTO.

[11]  Andrzej Lingas,et al.  A Polynomial-Time Algorithm for Subgraph Isomorphism of Two-Connected Series-Parallel Graphs , 1988, ICALP.

[12]  Andrzej Lingas Subgraph Isomorphism for Biconnected Outerplanar Graphs in Cubic Time , 1989, Theor. Comput. Sci..

[13]  L. Babai Automorphism groups, isomorphism, reconstruction , 1996 .

[14]  Gary L. Miller,et al.  Isomorphism testing for graphs of bounded genus , 1980, STOC '80.

[15]  Louis Goubin,et al.  SFLASHv3, a fast asymmetric signature scheme , 2003, IACR Cryptol. ePrint Arch..

[16]  Daniel A. Spielman,et al.  Faster isomorphism testing of strongly regular graphs , 1996, STOC '96.

[17]  Leonid A. Levin,et al.  Random instances of a graph coloring problem are hard , 1988, STOC '88.

[18]  Jos Dumortier,et al.  Directive 1999/93/EC on a community framework for electronic signatures , 2002 .

[19]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[20]  Naomi Nishimura,et al.  The Complexity of Subgraph Isomorphism for Classes of Partial k-Trees , 1996, Theor. Comput. Sci..