big number small computer
summary
Code implements a post-quantum supersingular isogeny key exchange on a Commodore 64 6510 8-bit CPU. It builds 448-bit integers as 56 8-bit words, implements field arithmetic modulo a 434-bit prime, and provides Montgomery routines. Multiplication is emulated with shifts and adds because 6510 has no MUL instruction. Finite-field and most Montgomery arithmetic are complete; the full isogeny key-exchange is in progress on GitHub and is estimated to take ~40 minutes for one side and ~60 minutes for the other.
AI-written summary · about
chapters (6)
- 0:00Start
- 1:49Post-Quantum Cryptography
- 6:28Commodore 64
- 8:40Index Registers
- 16:25The Fourier Transformation
- 17:14Review Classical Elliptic Curve Key Exchanges
related talks
57mShor's Algorithm is Scary NOW
58mFast Cryptographic Code via Partial Evaluation
33mEfficient Modular Arithmetic using Vectorization on CPUs and GPUs
57mQuantum Computing and the future of cryptography
01h 01mCryptography: The Weird Bits
32mCybersecurity in Post Quantum Era
58mBreaking Enigma with the Power of Modern C++
40mImplementation