| Title | Author | Created | Published | Tags | | ---------- | ------------------------------------------------------------------------------------------------------------- | -------------- | -------------- | -------------------------------------------------- | | In-Class 7 | <ul><li>Jon Marien (marien)</li><li>Lucas Oppedisano (oppedilu)</li><li>Mohammed Elsayed (elsayemu)</li></ul> | March 12, 2025 | March 12, 2025 | [[#classes\|#classes]], [[#MATH36206\|#MATH36206]] | Question: For a Merkle Tree with depth $d = 4$ with keys $(K₁=3, K₂=6, K₃=9, K₄=12, K₅=15, K₆=18, K₇=21, K₈=24, K₉=27, K₁₀=30, K₁₁=33, K₁₂=36, K₁₃=39, K₁₄=42, K₁₅=45, K₁₆=48)$ and hash function $h(x) = x\;mod\;7$: 1. Determine the value of the root node. 1. ![[image-103.png|295x393]] 2. Use the Merkle tree to sign the message. 1. See Below 3. Use the Merkle tree to sign the message. 1. See Below 4. How many messages can be signed using this Merkle tree? 1. ![[image-104.png|354x472]]