# PiouCrypt: Decentralized Lattice-based Method for Visual Symmetric Cryptography

arXiv: https://arxiv.org/abs/2204.08017 · HTML: https://mlsanity.com/paper/2204.08017/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 4 of its 40 references that are in the map.
- First posted on arXiv 17 Apr 2022.

## Builds on (most cited first, 4 of 4)

- [Algorithms and Comparisons of Non-negative Matrix Factorization with Volume Regularization for Hyperspectral Unmixing](https://mlsanity.com/paper/1903.04362/) (2019)
- [A Search for Good Pseudo-random Number Generators : Survey and Empirical Studies](https://mlsanity.com/paper/1811.04035/) (2018)
- [A Provably Correct and Robust Algorithm for Convolutive Nonnegative Matrix Factorization](https://mlsanity.com/paper/1906.06899/) (2019)
- [Xorshift1024*, Xorshift1024+, Xorshift128+ and Xoroshiro128+ Fail Statistical Tests for Linearity](https://mlsanity.com/paper/1810.05313/) (2018)

## Abstract (arXiv)

In recent years, establishing secure visual communications has turned into one of the essential problems for security engineers and researchers. However, only limited novel solutions are provided for image encryption, and limiting the visual cryptography to only limited schemes can bring up negative consequences, especially with emerging quantum computational systems. This paper presents a novel algorithm for establishing secure private visual communication. The proposed method has a layered architecture with several cohesive components, and corresponded with an NP-hard problem, despite its symmetric structure. This two-step technique is not limited to gray-scale pictures, and furthermore, utilizing a lattice structure causes to proposed method has optimal resistance for the post-quantum era, and is relatively secure from the theoretical dimension.