# Does sha256 is ok for that? If not does EC?

I think from what I studied that I had the correct reasoning, but I would like a double check. Here is the thing:

Given two matrix: A and B

I calculate the hashFunction(A, B) = C

Now I calcultate the eigenvalues of B: µ and the associate vector x

Now is the following equation correct:

C * x = hashFunction(A, µ) * x = hashFunction(A, µ*x)

Is it true given any hashfunction? Specifically given sha256, or Elliptic Curve Function, or any other?

EDIT:

My aim is, given a public information, to show that I am the owner of the information and gives other information, and avoids that if someone intercepts the password I give before it comes to the audience, he cannot uses it to gives different information.

So for the problem I gave, data are:

B is public

TO authentify me, I give hash(A, µ) and x

2nd EDIT

The answer to my question seems to rely in Signature as described in this paper. Has anyone an example of signature and verification algorithms ?

3rd EDIT:

So I implemented something, could it be use

encoded_Pwd=str(Input_STR).encode("utf-8")
key=hashlib.md5(encoded_Pwd).hexdigest()
PRIVATE_KEY = base64.urlsafe_b64encode(key.encode("utf-8"))


Then:

PUBLIC_KEY=sha256(PRIVATE_KEY).hexdigest()

• It is $$\text{By no means}$$ What is your aim? Dec 30, 2021 at 23:03
• @kelalaka do you mean the equation is false? even two first members? Dec 30, 2021 at 23:04
• sha256 is nonlinear - so, what do you mean by an 'eigenvector'? And, why do you expect sha256 to exhibit them? Dec 30, 2021 at 23:10
• the eigenvector is associated with the eigenvalue µ that is in fact my question: would it be possible with another crypto algorithm that still avoids to find back A and B given C ? Dec 30, 2021 at 23:16
• What is your aim, this is more important. In multi-party computations, there are tons of protocols to achieve various aims... Dec 31, 2021 at 13:34