Applications of Fermat’s and Euler’s Theorems
This chapter is devoted to some applications of Fermat’s and Euler’s theorems, mostly to numbers: decimal expansions, testing numbers for primeness, factoring numbers. Perhaps the most striking application, in Section B, is to the design of a cryptographic system, the RSA cryptosystem, which has spawned an enormous amount of research on factoring large numbers since the system was discovered in the late 1970s.
KeywordsPrime Divisor Fermat Number Decimal Expansion Perfect Number Plaintext Message
Unable to display preview. Download preview PDF.