1/ Earlier this year, @yuval_domb discovered Logjumps — a more efficient way to do large-prime field multiplication than Montgomery multiplication. So much modern crypto relies on modular multiplication — all the way from TLS sessions to elliptic-curve based ZK proofs.

2/ Intrigued, I wrote a research note to help cryptography engineers deeply understand both techniques:

3/ Most existing literature does not clearly bridge theory and code. I aim to fill this gap with this writeup. Readers will gain a strong working intuition behind regular Montgomery multiplication and Logjumps. This may pave the way to new improvements and optimisations.