Saved in:
| Main Author: | |
|---|---|
| Format: | Recurso digital |
| Language: | |
| Published: |
Zenodo
2026
|
| Online Access: | https://doi.org/10.5281/zenodo.19654846 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- <p>We introduce the Matrix Cryptographic Tree (MCT), a reversible and structure-preserving</p> <p>authenticated structure based entirely on products of fixed 2×2 integer matrices. In contrast to</p> <p>Merkle trees and other hash-based constructions, MCT is fully invertible: every encoded matrix</p> <p>admits a unique decoding path determined solely by non-negativity constraints on intermediate</p> <p>matrices. This yields three fundamental properties that are unattainable in hash-based systems:</p> <p>(1) injective encoding without collisions, (2) deterministic and unique decoding, and (3) algebraic</p> <p>tamper detection in which any modification of a matrix entry necessarily violates the decoding</p> <p>rule.</p> <p> </p>