Elliptic Curve Digital Signature Algorithm (ECDSA) (Money Button Documentation Series)

preview_player
Показать описание

We are covering all of the material a developer needs to know to be able to build applications on the Bitcoin SV (BSV) blockchain, with or without Money Button. This documentation assumes the viewer is a developer who knows how to build an app, but who doesn't yet know much about Bitcoin SV.

Рекомендации по теме
Комментарии
Автор

Great stuff, I really like your explaining insights with examples. Thanks.

BenjaminPovirk
Автор

You made it look easy! Thank you for this content MoneyButton. It is powerful. Cheers.

shwimmy
Автор

Money Button thank you for great explanation.

4:59 i think there is a typo: Fermat Little Theroem shoudbe "and a^(p-1) = 1 (mod p)" rather than "0 (mod p)" could you check?

VicZ
Автор

Is the EC Discrete Log problem similar to the Discrete Log problem because the finite field? That's basically where the modulus operation comes in from what I understand, which sounds like the source of difficulty in the first case.

JonathanVaage
Автор

ECDSA - R, S and Z values from Nested SegWit (P2SH) Transaction - how to find them?

АлексейБояров-гз