X-Git-Url: https://git.carlh.net/gitweb/?p=dcpomatic.git;a=blobdiff_plain;f=doc%2Fmanual%2Fdcpomatic.xml;h=664b05438247d91bde3d5490247b1207924d6c92;hp=a8065a75423387db639fb6c3653f2107d2b84a23;hb=51e2ea8ee216222378e05e62b0ebaf998e3a2ff3;hpb=1b273e2c4a5c022f44ac82cbc662c62473335b88 diff --git a/doc/manual/dcpomatic.xml b/doc/manual/dcpomatic.xml index a8065a754..664b05438 100644 --- a/doc/manual/dcpomatic.xml +++ b/doc/manual/dcpomatic.xml @@ -1560,8 +1560,8 @@ methods to understand it. -We suppose that we are trying to distribute a DCP, to -Alice's cinema, without a troublemaker called Mallory being able to +We suppose that we are trying to send a DCP to +Alice's cinema without a troublemaker called Mallory being able to watch it himself. @@ -1588,11 +1588,12 @@ happened to know Mallory, she could just send him a copy of the key. -The clever bit in DCP encryption requires the use of public-key +The clever bit in the process requires the use of public-key encryption. With this technique we can encrypt a block of data using some ‘public’ key. That data can then only be decrypted -using a different ‘private’ key. The -private and public keys are related mathematically, but it is +using a corresponding private key which is +different to the public key. The private and +public keys form a pair which are related mathematically, but it is extremely hard (or rather, virtually impossible) to derive the private key from the public key.