| Summary: |
In this unit we introduce some elementary concepts from number theory that are used in many modern ciphers and related security systems. We start with some basic definitions before discussing the division algorithm which lies at the heart of the important Euclidean algorithm. The discussion then moves on to look at prime numbers and describes how
prime factorisation can be applied to express any integer, greater than one, as a product of primes. The concept of a greatest common divisor (GCD) of two positive integers is described and we discuss how prime factorisation can be used to calculate this quantity when the numbers are relatively small. We then introduce the Euclidean algorithm which
provides an efficient method for calculating the GCD of two integers regardless of their size. |
| Creators: |
|
| Divisions: |
Academic > School of Computing, Engineering and Built Environment > Department of Computing
Academic > School of Computing, Engineering and Built Environment |
| Copyright holder: |
Copyright © Glasgow Caledonian University |
| Viewing permissions: |
World |
| Depositing User: |
|
| Date Deposited: |
21 Jun 2017 08:14 |
| Last Modified: |
16 Mar 2018 10:37 |
| URI: |
https://edshare.gcu.ac.uk/id/eprint/2716 |
Loading previews...
