What is elliptic curve digital signature algorithm


#1

i heard about elliptic curve digital signature algorithm
What is this anyone know this please explain me with example for batter understanding


#2

I also don’t know, maybe others know that. I just found out your information now. Many things I don’t know yet, and hopefully in this forum I get a lot of knowledge.


#3

thank you for your answer


#4

This is also the first time I heard about this algorithm. There are many there on which different coins are based but never heard of this one.

Please don’t spam just for the sake of increasing post count.


#5

i do not want any answer from you


#6

Miss, this is an open forum. I can post and comment wherever I want as long as I follow the rules of the forum and don’t offend anyone intentionally. If you’re so offended by me that you don’t want my answers then either start writing good useful content about which I don’t have any knowledge or stop writing at all.

Have a good day.


#7

PLEASE READ AND UNDERSTAND THIS

Elliptic Curve Digital Signature

Algorithm or ECDSA is a cryptographic algorithm used by Bitcoin to ensure that funds can only be spent by their rightful owners.

A few concepts related to ECDSA:

PPRIVATE KEY A secret number, known only to the person that generated it. A private key is essentially a randomly generated number. In Bitcoin, someone with the private key that corresponds to funds on the public ledger can spend the funds. In Bitcoin, a private key is a single unsigned 256 bit integer (32 bytes).

PUBLIC KEY: A number that corresponds to a private key, but does not need to be kept secret. A public key can be calculated from a private key, but not vice versa. A public key can be used to determine if a signature is genuine (in other words, produced with the proper key) without requiring the private key to be divulged. In Bitcoin, public keys are either compressed or uncompressed. Compressed public keys are 33 bytes, consisting of a prefix either 0x02 or 0x03, and a 256-bit integer called x . The older uncompressed keys are 65 bytes, consisting of constant prefix (0x04), followed by two 256-bit integers called x and y (2 * 32 bytes). The prefix of a compressed key allows for the y value to be derived from the x value.

SIGNATURE : A number that proves that a signing operation took place. A signature is mathematically generated from a HASH of something to be signed, plus a private key. The signature itself is two numbers known as r and s . With the public key, a mathematical algorithm can be used on the signature to determine that it was originally produced from the hash and the private key, without needing to know the private key. Signatures are either 73, 72, or 71 bytes long, with probabilities approximately 25%, 50% and 25% respectively, although sizes even smaller than that are possible with exponentially decreasing probability.


#8

Yes, this is a complex information and is more suitable for developers and IT professionals, but I also have an interest. Thank you for the detailed explanation.