/explore
|
You are here 
|
words.filippo.io | ||
| | | | |
gpfault.net
|
|
| | | | | [AI summary] The text provides an in-depth exploration of various x86-64 instruction set architectures, focusing on arithmetic operations (ADD, SUB, MUL, SMUL, DIV, SDIV), logical operations (AND, OR, XOR, NOT), and control flow instructions. It details the implementation of these instructions in the QBX virtual machine, emphasizing how they emulate real x86-64 instructions while managing the flags register and handling different operand sizes (8-bit and 16-bit). The text also discusses the nuances of flag handling, register operations, and macro-based code generation to streamline instruction implementation. | |
| | | | |
www.jeremykun.com
|
|
| | | | | So far in this series we've seen elliptic curves from many perspectives, including the elementary, algebraic, and programmatic ones. We implemented finite field arithmetic and connected it to our elliptic curve code. So we're in a perfect position to feast on the main course: how do we use elliptic curves to actually do cryptography? History As the reader has heard countless times in this series, an elliptic curve is a geometric object whose points have a surprising and well-defined notion of addition. | |
| | | | |
cronokirby.com
|
|
| | | | | - Read more: https://cronokirby.com/posts/2021/06/introducing_nimotsu/ | |
| | | | |
www.craigstuntz.com
|
|
| | | Craig Stuntz's personal website about programming languages, type theory, DIY synthesizers, compilers, and math. | ||
