Before we explore the depths of Bitcoin technology, we’ll cover some foundational topics.
Prime Numbers (Chapter 8.1)
Fermat and Euler's Theorems (Chapter 8.2)
Primality Testing (Chapter 8.3)
Modular Arithmetic and Discrete Logarithms (Chapter 8.5)
Finite Fields in the Form GF(p) (Chapters 5.1 and 10.3)
Abelian Groups and Elliptic Curves (Chapter 10.3)
Elliptic Curve Arithmetic (Chapter 10.3)
Elliptic Curve Cryptography (ECDSA) (Chapter 10.4)
Random Number Generators and Pseudorandom Functions (PRFs):
Principles of Pseudorandom Number Generation (Chapter 7.1)
True Random Number Generators (Chapter 7.6)
SHA-256 (Secure Hash Algorithm) (Chapter 11.5)
Applications of Cryptographic Hash Functions (Chapter 11.1)
Elliptic Curve Digital Signature Algorithm (Chapter 13.5)
Properties and Requirements of Digital Signatures (Chapter 13.1)
Hash-based MACs: HMAC (Chapter 12.5)
Public Key Distribution (Chapter 14.3)
At Scalar School, we are committed to never skipping any foundational steps and are not afraid to start small. This careful approach is designed to ensure that when we begin delivering code and content, it is of the highest quality.
The open-source landscape is competitive, and we aim to prepare our students to confidently stand among the best.
We are dedicated to building a robust foundation and increasing the representation of women in Bitcoin development and education, empowering a new generation of developers to innovate and excel in this dynamic field.
Success won’t happen overnight—we are here to walk the good walk and actively engage with and learn from the feedback of the global Bitcoin FOSS development community.
Is there anything else you’d like to see covered, or do you feel something important is missing? Let us know in the comments.
