# Re: C-equivalence aware hash function

*From*: "Milan VXdgsvt" <milan_vxdgsvt@xxxxxxxxx>*Date*: Fri, 2 Dec 2005 00:33:55 +0000 (UTC)

Francois Grieu wrote:

> daw@xxxxxxxxxxxxxxxxxxxxxxxx (David Wagner) wrote:

>

> > Can we view the nxn matrix M as the adjacency matrix of a bipartite

> > graph G(M) on 2n vertices?

> Things get so easy when David explain them...

>

True, true.

In fact I have forgotten you could swap rows and columns independently.

> Thus my problem seems a (harder) variant of graph isomorphism, and

> probably similar techniques apply.

I hope I'm not leading you in a wrong way.

The paper about Nauty in fact describes "Hadamard equivalence" on p.

82+ that is exactly your definition of C-equivalence, and shows how to

convert matrix containing +-1 to a graph. Perhaps this would work with

0 elements as well.

I wish I understood how that Nauty works... but the paper expects too

deep knowledge. Perhaps someone in a math newsgroup could help you.

Milan

.

**Follow-Ups**:**Re: C-equivalence aware hash function***From:*Francois Grieu

**References**:**Re: C-equivalence aware hash function***From:*Milan VXdgsvt

**Re: C-equivalence aware hash function***From:*Francois Grieu

**Re: C-equivalence aware hash function***From:*David Wagner

**Re: C-equivalence aware hash function***From:*Francois Grieu

- Prev by Date:
**Re: Choice of a and b in SRP-6** - Next by Date:
**Re: Defeating keyloggers with encrypted one time passwords (a patent spoiler?)** - Previous by thread:
**Re: C-equivalence aware hash function** - Next by thread:
**Re: C-equivalence aware hash function** - Index(es):