PiouCrypt: Decentralized Lattice-based Method for Visual Symmetric
Cryptography
- URL: http://arxiv.org/abs/2204.08017v1
- Date: Sun, 17 Apr 2022 13:28:32 GMT
- Title: PiouCrypt: Decentralized Lattice-based Method for Visual Symmetric
Cryptography
- Authors: Navid Abapour, Mohsen Ebadpour
- Abstract summary: 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.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: 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.
Related papers
- S-box Security Analysis of NIST Lightweight Cryptography Candidates: A Critical Empirical Study [0.2621434923709917]
NIST issued a call for standardization of Lightweight cryptography algorithms in 2018.
Ascon emerged as the winner of this competition.
We evaluate the S-boxes of six finalists in the NIST Lightweight Cryptography (LWC) standardization process.
arXiv Detail & Related papers (2024-04-09T07:56:52Z) - Coding-Based Hybrid Post-Quantum Cryptosystem for Non-Uniform Information [53.85237314348328]
We introduce for non-uniform messages a novel hybrid universal network coding cryptosystem (NU-HUNCC)
We show that NU-HUNCC is information-theoretic individually secured against an eavesdropper with access to any subset of the links.
arXiv Detail & Related papers (2024-02-13T12:12:39Z) - Assessment of cryptographic approaches for a quantum-resistant Galileo OSNMA [4.281182764767519]
We analyse the state of the Galileo Open Service Navigation Message Authentication (OSNMA) to overcome these new threats.
The main barrier to adopting the PQC approach is the size of both the signature and the key.
This work concludes by assessing different temporal countermeasures that can be implemented to sustain the system's integrity in the short term.
arXiv Detail & Related papers (2023-12-18T10:20:50Z) - Enhancing the security of image transmission in Quantum era: A
Chaos-Assisted QKD Approach using entanglement [0.0]
Quantum computing has introduced unprecedented security challenges to conventional cryptographic systems.
This research addresses these challenges by innovatively combining quantum key distribution (QKD) with logistic chaotic maps to establish a secure image transmission scheme.
arXiv Detail & Related papers (2023-11-30T11:26:38Z) - Lightweight Public Key Encryption in Post-Quantum Computing Era [0.0]
Confidentiality in our digital world is based on the security of cryptographic algorithms.
In the course of technological progress with quantum computers, the protective function of common encryption algorithms is threatened.
Our concept describes the transformation of a classical asymmetric encryption method to a modern complexity class.
arXiv Detail & Related papers (2023-11-24T21:06:42Z) - Optimizing Solution-Samplers for Combinatorial Problems: The Landscape
of Policy-Gradient Methods [52.0617030129699]
We introduce a novel theoretical framework for analyzing the effectiveness of DeepMatching Networks and Reinforcement Learning methods.
Our main contribution holds for a broad class of problems including Max-and Min-Cut, Max-$k$-Bipartite-Bi, Maximum-Weight-Bipartite-Bi, and Traveling Salesman Problem.
As a byproduct of our analysis we introduce a novel regularization process over vanilla descent and provide theoretical and experimental evidence that it helps address vanishing-gradient issues and escape bad stationary points.
arXiv Detail & Related papers (2023-10-08T23:39:38Z) - Revocable Cryptography from Learning with Errors [61.470151825577034]
We build on the no-cloning principle of quantum mechanics and design cryptographic schemes with key-revocation capabilities.
We consider schemes where secret keys are represented as quantum states with the guarantee that, once the secret key is successfully revoked from a user, they no longer have the ability to perform the same functionality as before.
arXiv Detail & Related papers (2023-02-28T18:58:11Z) - NEQRX: Efficient Quantum Image Encryption with Reduced Circuit Complexity [2.7985570786346745]
We propose an efficient implementation scheme for a quantum image encryption algorithm combining the generalized affine transform and logistic map.
We achieve a remarkable 50% reduction in cost while maintaining security and efficiency.
arXiv Detail & Related papers (2022-04-14T10:15:23Z) - Inverse design of photonic devices with strict foundry fabrication
constraints [55.41644538483948]
We introduce a new method for inverse design of nanophotonic devices which guarantees that designs satisfy strict length scale constraints.
We demonstrate the performance and reliability of our method by designing several common integrated photonic components.
arXiv Detail & Related papers (2022-01-31T02:27:25Z) - Quantum verification and estimation with few copies [63.669642197519934]
The verification and estimation of large entangled systems represents one of the main challenges in the employment of such systems for reliable quantum information processing.
This review article presents novel techniques focusing on a fixed number of resources (sampling complexity) and thus prove suitable for systems of arbitrary dimension.
Specifically, a probabilistic framework requiring at best only a single copy for entanglement detection is reviewed, together with the concept of selective quantum state tomography.
arXiv Detail & Related papers (2021-09-08T18:20:07Z) - The Power of Triply Complementary Priors for Image Compressive Sensing [89.14144796591685]
We propose a joint low-rank deep (LRD) image model, which contains a pair of complementaryly trip priors.
We then propose a novel hybrid plug-and-play framework based on the LRD model for image CS.
To make the optimization tractable, a simple yet effective algorithm is proposed to solve the proposed H-based image CS problem.
arXiv Detail & Related papers (2020-05-16T08:17:44Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.