CHAPTER 13
PRIME NUMBERS AND FACTORIZATION
BEFORE MICROSOFT AND DELL enlarged our computational horizons, mathematicians explored the mysteries of numbers. The publication in 1978 of the RSA algorithm, whose strength appears to depend on infeasibility factoring very large numbers, stimulated research in number theory. This chapter describes the dual number theoretic issues of factorization and primality testing.
Get Computer Security and Cryptography now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.