Appendix A. Background cryptography
In this appendix we provide some further number theoretic and cryptographic background. We omit most of the proofs, since they can be found in any good reference on cryptography or number theory, for example [100].
A number a divides b if there exists a k such that a.k = b. In this case we say that a is a factor of b.
A prime number is a number greater than 1 divisible only by 1 and itself, for example 3, 5 ,7, etc. It has been known since Euclid that there exists an infinity of primes. Their distribution amongst the integers follows no known pattern, though certain statistical facts are known in the form of the well-known prime number theorem. This states that the number of primes less than or equal to n
Get The Modelling and Analysis of Security Protocols: the CSP Approach now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
