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?
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
The answer to my question seems to rely in Signature as described in this paper. Has anyone an example of signature and verification algorithms ?
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"))