I had the idea of storing large amounts of data in a small space using a Merkle tree. But from what I understand about Merkle trees is you cannot extract the data from the Merkle root (since hashes are not reversible). Though I wonder, is there a way to use an encryption algorithm that gives a fixed output length like how we use hashes in Merkle trees? I know my question is hard to understand but looking at this diagram may give you a better idea of what I am trying to do here:
Storing data in a MerkelMerkle tree
Storing data in a Merkel tree
I had the idea of storing large amounts of data in a small space using a Merkle tree. But from what I understand about Merkle trees is you cannot extract the data from the Merkle root (since hashes are not reversible). Though I wonder, is there a way to use an encryption algorithm that gives a fixed output length like how we use hashes in Merkle trees? I know my question is hard to understand but looking at this diagram may give you a better idea of what I am trying to do here:
Storing data in a Merkle tree
I had the idea of storing large amounts of data in a small space using a Merkle tree. But from what I understand about Merkle trees is you cannot extract the data from the Merkle root (since hashes are not reversible). Though I wonder, is there a way to use an encryption algorithm that gives a fixed output length like how we use hashes in Merkle trees? I know my question is hard to understand but looking at this diagram may give you a better idea of what I am trying to do here:
I had the idea of storing large amounts of data in a small space using a MerkelMerkle tree. But from what I understand about MerkelMerkle trees is you cannot extract the data from the MerkelMerkle root (since hashes are not reversible). Though I wonder, is there a way to use an encryption algorithm that gives a fixed output length like how we use hashes in MerkelMerkle trees? I know my question is hard to understand but looking at this diagram may give you a better idea of what I am trying to do here:
I had the idea of storing large amounts of data in a small space using a Merkel tree. But from what I understand about Merkel trees is you cannot extract the data from the Merkel root (since hashes are not reversible). Though I wonder, is there a way to use an encryption algorithm that gives a fixed output length like how we use hashes in Merkel trees? I know my question is hard to understand but looking at this diagram may give you a better idea of what I am trying to do here:
I had the idea of storing large amounts of data in a small space using a Merkle tree. But from what I understand about Merkle trees is you cannot extract the data from the Merkle root (since hashes are not reversible). Though I wonder, is there a way to use an encryption algorithm that gives a fixed output length like how we use hashes in Merkle trees? I know my question is hard to understand but looking at this diagram may give you a better idea of what I am trying to do here:
Storing data in a Merkel tree
I had the idea of storing large amounts of data in a small space using a Merkel tree. But from what I understand about Merkel trees is you cannot extract the data from the Merkel root (since hashes are not reversible). Though I wonder, is there a way to use an encryption algorithm that gives a fixed output length like how we use hashes in Merkel trees? I know my question is hard to understand but looking at this diagram may give you a better idea of what I am trying to do here: