# Distance-Bounding Protocol

### Lambert M. Surhone

**ISBN: 978-6-1329-2218-2;**

**Издательство: Книга по требованию**

In mathematics, specifically in abstract algebra and its applications, discrete logarithms are group-theoretic analogues of ordinary logarithms. In particular, an ordinary logarithm loga(b) is a solution of the equation ax = b over the real or complex numbers. Similarly, if g and h are elements of a finite cyclic group G then a solution x of the equation gx = h is called a discrete logarithm to the base g of h in the group G. Discrete logarithms are perhaps simplest to understand in the group (Zp)?. This is the set {1, …, p ? 1} of congruence classes under multiplication modulo the prime p. If we want to find the kth power of one of the numbers in this group, we can do so by finding its kth power as an integer and then finding the remainder after division by p. This process is called discrete exponentiation. For example, consider (Z17)?. To compute 34 in this group, we first compute 34 = 81, and then we divide 81 by 17, obtaining a remainder...

- OZON.ru 1921