Explore >> Select a destination
|
You are here 
|
afiodorov.github.io | ||
| | | | |
www.jeremykun.com
|
|
| | | | | So here we are. We've studied the general properties of elliptic curves, written a program for elliptic curve arithmetic over the rational numbers, and taken a long detour to get some familiarity with finite fields (the mathematical background and a program that implements arbitrary finite field arithmetic). And now we want to get back on track and hook our elliptic curve program up with our finite field program to make everything work. | |
| | | | |
gist.github.com
|
|
| | | | | [python]basics of elliptic curve cryptography. GitHub Gist: instantly share code, notes, and snippets. | |
| | | | |
www.johndcook.com
|
|
| | | | | The Bitcoin key mechanism is based on elliptic curve cryptography over a finite field. This post gives a brief overview. | |
| | | | |
patshaughnessy.net
|
|
| | | [AI summary] The article discusses the process of learning to read x86 assembly language, focusing on how it can be a useful skill for understanding low-level operations of microprocessors. It outlines the challenges of reading assembly, especially in debugging scenarios, and provides an example of translating Ruby code into x86 assembly using Crystal. The article also explains the syntax and structure of x86 assembly, including register usage, instruction suffixes, and the differences between AT&T and Intel syntax. It highlights the complexity of x86 assembly due to its historical evolution and the need for understanding register sizes and operand notation. | ||
