Dixon Factorization for a Number Theory or Cryptography Class
Dixon Factorization for a Number Theory or Cryptography Class
P. Costello
2018 · DOI: 10.1080/10511970.2018.1471631
PRIMUS - Problems, Resources, and issues in mathematics undergraduate studies · 0 Citations
TLDR
This paper shows how to implement the idea of Dixon factorization on the computer in the classroom, and pseudocode is given for finding examples suitable for demonstrating DixonFactorization.
Abstract
Abstract In 1981 Dixon introduced a clever idea for factoring large numbers. This idea has become the basis for many current factoring techniques. In this paper, we show how to implement the idea on the computer in the classroom. Additionally, pseudocode is given for finding examples suitable for demonstrating Dixon factorization.