Functions, Hash Functions, Cryptography - Discussion

Sorry to make that many questions :upside_down_face:
If the funds transferred from a centralized Exchange to a Dwallet are sent to another wallet that changes the addresses, would this address still be compromised?

I really appreciate your help :gem::pray:t2::sparkles:

Well, there is still a link from the previous address. But its impossible to tell if you send these funds to yourself on a different wallet or to someone else. If you would send these funds to a dark market website for example you could be liable. :slight_smile:

2 Likes

A crystal clear answer :slight_smile: Thanks for time :gem:

From a “music note sharp” symbol to a numbered ranking to a call-to-subject or reference theme a hash is currently crypto-hieroglyph to me.

Its possible roles?

  • maybe giving hands between to actions?
  • maybe start or finish a sentence?
  • maybe a hash is like punctuation, yes. It could plays different roles regarding of its surrounding, like a comma appending elements of description , or like a subtracting minus that converts into a marrying dash?

Honestly, I ignore it.

Hello, just finished the cryptography chapter. I have 2 queries, through if you wonderful people could help me understand.

  1. To generate Digital signature why Sender need to encrypt the message with his private key. He can use his public key as well?
  2. Is there any possibility that Wallet provider can store your private key with them?

Thanks

Are these rethorical questions? Because I don’t know how to answer them :smile:

2 Likes

To encrypt a message you use the public key, which the user can decrypt using his private key.
Digital signatures are kind of the opposite where the sender signs a message with his private key and others can verify using the public key.

You mean a hosted wallet? In that case they are the owners of your private key basically. For applications they can for sure, that’s why it I would recommend using only Open source wallets. If a wallet would do this kind of thing, its easier to notice by checking the source code. :slight_smile:

1 Like

In the Hash Function video at the beginning you state that a unique input gives a unique output. Surely this is factually incorrect. This would imply that there would NEVER be any collisions which is not true. Multiple different inputs to SHA-256 can give the SAME output … it is just that the chance of it happening is statistically low.

1 Like

To be honest I have forgot what exactly is stated in the video since its been so long since I have seen it. But you are right. 2^256 is still infinitely smaller than infinity (or all possible inputs). So a hash function is bound to have collisions. :slight_smile:

2 Likes

Just came to the landing page for Functions, Hash Functions and Cryptograhy - discussion…,

there is no video and nothing to read. Is it just a landing page that I’m supposed to indicate that I landed on, then move on to the next video? Or, is there something to learn from this page that’s not showing? Just keep moving on with the other videos and it will come up later?? Please advise. Thanks. Nick

You mean on the academy? Can you share a screenshot to help me investigate? :slight_smile:

1 Like

think I undestood 80-90% of lessons. I mean understood the concepts, not how to use that.
Not bad, considering six months ago i thought bitcoin and blockchain was only a speculation.

“Hash, hash
I thought I heard her calling my name now
Hash, hash”

Ah no, that was HUSH. :sweat_smile:
But maybe they spoke about some other kind of hash :shamrock:

No worries, It’s just a landing page (introduction), like to cover of a book; a title, but no reading material

Hey guys, I’m totally new so please bear with me. Can someone help me understand how for example in SHA-256 that you can’t get the input from the output? From my perspective, I’m thinking that if the algorithm is the same for everyone who used SHA-256 then would it not be simple to retrace back to the input?

2 Likes

You can try it, but I assure you a lot of people have :wink: non reversable functions don’t have to be complex, the simplest one for example is addition. If you know the answer is 5, you can’t know exactly what the input is, the formula can look like this:
x - x + 5 = 5
This is of course a stupid example, but from this formula you can’t conclude what x is, it can literally be any rational number and the result would be valid. :slight_smile:

5 Likes
2 Likes

Thank you, this in very helpful

Will SHA256 remain same forever?

Not sure what you mean by that? Sha256 will never change, it might get replaced by a new algorithm. :slight_smile:

2 Likes

Thank you for the reply. That’s what i meant. it might get replaced by a new algorithm.