{"paper":{"title":"An algorithm for hiding and recovering data using matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Di\\'ogenes Galetti, Salomon S. Mizrahi","submitted_at":"2018-03-12T16:08:31Z","abstract_excerpt":"We present an algorithm for the recovery of a matrix $\\mathbb{M}$ % (non-singular $\\in $ $\\mathbb{C}^{N\\times N}$) by only being aware of two of its powers, $\\mathbb{M}_{k_{1}}:=\\mathbb{M}^{k_{1}}$ and $\\mathbb{M}% _{k_{2}}:=\\mathbb{M}^{k_{2}}$ ($k_{1}>k_{2}$) whose exponents are positive coprime numbers. The knowledge of the exponents is the key to retrieve matrix $\\mathbb{M}$ out from the two matrices $\\mathbb{M}_{k_{i}}$. The procedure combines products and inversions of matrices, and a few computational steps are needed to get $\\mathbb{M}$, almost independently of the exponents magnitudes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.05003","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}