Integer factorization

• Sep 11, 2026
• cryptography

Pollard Rho, P-1, and Elliptic Curve Factoring

Book: Computational Number Theory and Modern Cryptography
Author: Song Y. Yan
ISBN: 978-1-118-18858-3 (Wiley, 2013)

Chapter 4 is the problem crypto actually rests on. Yan writes IFP as: input a composite n, output one nontrivial factor f. Not the full factorization. Just a split. Recurse with a primality test if you want the prime picture.

• Sep 02, 2026
• cryptography

Computation Theory and Why Hard Problems Matter

Sections 1.3 and 1.4 of Computational Number Theory and Modern Cryptography are the moment the textbook stops warming up. Song Y. Yan, ISBN 978-1-118-18858-3, finally names the problems the rest of the book will live inside. I read this as the whole map on one table. Computational number theory, the hard problems, then modern crypto after the 1970s.