Updating reference in chapter 2

Author: Luka Kurnjek

chapters/chapter-02-cryptography.adoc

@@ -170,7 +170,7 @@ Hashing functions are fundamental to blockchains. Some examples of where hashing
 
 . *Address derivation* -- Hashing algorithms are often used in blockchains as a means of deriving wallet addresses--e.g., as discussed in Section <<create-wallet>>.
 
-. *Merkleization(((merkle)))* allows for large collections of data items to be compacted into a smaller structure i.e., a merkle tree, and still be able to prove that a particular data item is represented within the merkle tree without having to store the full data items. Merkleization is discussed later in the <<marlowe-security>> section.
+. *Merkleization(((merkle)))* allows for large collections of data items to be compacted into a smaller structure i.e., a merkle tree, and still be able to prove that a particular data item is represented within the merkle tree without having to store the full data items. Merkleization is discussed later in the <<chapter8-marlowe-security>> section.
 
 . *Content-Addressed Storage(((content-addressed storage)))* -- When other information or files are required to be referenced (for example from a smart contract) it is often useful to refer to the specific file (or information) using Content-Addressed Storage which refers to such information/files using a hash of their content. By doing so, it is immediately possible to determine whether the contents have been changed, since the reference to find the information/file is a hash that should match the computed hash of the content--which can be done at any point. Furthermore, such a referencing scheme allows for deduplication of information, e.g., if the same image data is referred to twice, only one version of the file needs to be stored since both references will be computed to be the same hash.