
Elliptic Curve Cryptography: Inverses and Group Structure
By Brian HIrschfield and Rob Hamilton
Ep. 4 · Aired Mar 2, 2026 · 1h 32m · Last boosted Apr 30, 2026
Chapters
Show Notes
The Study guide: https://ecc-study-guide.magicinternetmath.com/guide.pdf In this episode of the Magic Internet Math Podcast, the hosts continue their exploration of elliptic curve cryptography, focusing on the inverse problem and the mathematical structures that ensure its existence, as part of their series on Bitcoin security. Key Topics: Inverse Problem Modular Arithmetic Groups and Fields Euclidean Algorithm Fermat's Little Theorem LibSecP Library Summary: The hosts emphasize the importance of understanding the mathematical foundations of Bitcoin, specifically the inverse problem, where a public key can be inverted back into its...
Nostr Boost Stats
- sats
- 1.2k
- boosts
- 2
- boosters
- 2
Nostr Community
Everyone who has boosted Elliptic Curve Cryptography: Inverses and Group Structure on Nostr, ranked by sats sent, all time.
Episode Boosts
Every boost sent to this episode, as published to Nostr, newest first.
-
This will turn plebs into pioneers
-
I didn't realize this was a podcast too. I'll need to catch up on the other episodes, but the fact that you're talking about modulo math with Rob Hamilton is epic. 😃

















