{"id":15756,"date":"2022-07-27T06:54:11","date_gmt":"2022-07-27T06:54:11","guid":{"rendered":"https:\/\/www.booksofall.com\/tw\/?post_type=product&p=15756"},"modified":"2022-07-27T07:04:38","modified_gmt":"2022-07-27T07:04:38","slug":"yet-another-introductory-number-theory-textbook-cryptology-emphasis-poritz","status":"publish","type":"product","link":"https:\/\/www.booksofall.com\/tw\/yet-another-introductory-number-theory-textbook-cryptology-emphasis-poritz\/","title":{"rendered":"Yet Another Introductory Number Theory Textbook – Cryptology Emphasis (Poritz)"},"content":{"rendered":"

This introductory number theory textbook has a particular emphasis on connections to cryptology<\/a>. The cryptologic material arising naturally out of the ambient number theory. The main cryptologic applications \u2014 being the RSA cryptosystem, Diffie-Hellman key exchange, and the ElGamal cryptosystem<\/a> \u2014 come out so naturally from considerations of Euler’s Theorem<\/a>, primitive roots, and indices that it renders quite ironic G.H. Hardy’s assertion of the purity and eternal inapplicability of number theory.<\/p>\n

Well-Ordering and Division<\/h3>\n

In this chapter, we present three basic tools that will often be used in proving properties of the integers. We start with a very important property of integers called the well-ordering principle. We then state what is known as the pigeonhole principle<\/a>, and then we proceed to present an important method called mathematical induction.<\/p>\n

The Euclidean Algorithm<\/h3>\n

In this section, we describe a systematic method that determines the greatest common divisor of two integers, due to Euclid and thus called the Euclidean algorithm. Now to the Euclidean algorithm in its general form, which basically states that the greatest common divisor of two integers is the last non-zero remainder of successive divisions.<\/p>\n

The full version of this theorem, with the \u2019s and , is called the extended Euclidean Algorithm, while a simpler version without those coefficients is know as Euclidean Algorithm.<\/p>\n

The attentive reader will have seen that We did not actually prove that the \u2019s and \u2019s can be used, as claimed, to write the as a linear combination of and . This proof is left as an exercise, below.<\/p>\n

Linear Congruences<\/h3>\n

Because congruence is analogous to equality, it is natural to ask about the analogues of linear equations, the simplest equations one can solve in algebra<\/a>, but using congruence rather than equality. In this section, we discuss linear congruences of one variable and their solutions.<\/p>\n

The Chinese Remainder Theorem<\/h3>\n

In this section, we discuss solutions of systems of congruences having different moduli. An example of this kind of systems is the following: find a number that leaves a remainder of when divided by , a remainder of when divided by three, and a remainder of when divided by . We shall see that there is a systematic way of solving this kind of system.<\/p>\n","protected":false},"excerpt":{"rendered":"