Cryptography Reference
In-Depth Information
Extended Euclidean Algorithm. Then Bob computes:
(
y
k
)
−
1
(
Py
k
)
(
y
k
)
−
1
mod
p
C
2
×
=
×
P
×
(
y
k
(
y
k
)
−
1
) mod
p
=
×
=
P
×
1
=
P
mod
p
,
which is what we require.
Several of the recommended existing cryptography topics, such as Menezes,
van Oorschot and Vanstone [123], Mel and Baker [122] and Stinson [185],
also include explanations of some the basic mathematics that we have discussed,
although these vary in the level of detail and degree of assumed knowledge. For
further details of basic number theory there are a number of good options, of
which Tattersall [190] is one of the more accessible.
