Lecture Cryptography and network security: Chapter 2

Lecture Cryptography and network security: Chapter 2 after studying this section will help you understand: To review integer arithmetic, concentrating on divisibility and finding the greatest common divisor using the Euclidean algorithm; To understand how the extended Euclidean algorithm can be used to solve linear Diophantine equations, to solve linear congruent equations, and to find the multiplicative inverses;...

Từ khóa: Lecture Cryptography and network security, Cryptography and network security, Mathematics of Cryptography, Modular Arithmetic, Integer arithmetic, Integer Division