Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Optics and Lasers in Engineering

Bilateral deep learning asymmetric cryptosystem based on quantum walk and hiding through diffraction orders

Isha Mehra, Naveen Kumar Nishchal

Published Jun 25, 2026• 0 citations
Publisher
DOI
10.1016/j.optlaseng.2026.109957

Related papers

Camouflaged image cryptosystem based on compressive interference against deep learning

Yabin Zhang, Zhiwen Jin, Mingguang Shan +5 more

Optik•May 29, 2023•1 citation

Cryptanalysis of computational optical ghost imaging cryptosystems via deep learning

Wenqi He

OPTICS & PHOTONICS International Congress•Mar 1, 2019•0 citations

Quantum Blind Signature Scheme with Cluster States Based on Quantum Walk Cryptosystem

Jinjing Shi, Hui Chen, Fang Zhou +3 more

International Journal of Theoretical Physics•Feb 6, 2019•10 citations

Quantum asymmetric cryptography with symmetric keys

Fei Gao, Qiaoyan Wen, Su‐Juan Qin +1 more

arXiv:0810.2859•Science in China. Series G, Physics, mechanics & astronomy/Science in China. Series G, Physics, Mechanics & Astronomy•Dec 1, 2009•31 citations

On the Hardness of the Asymmetric Learning With Errors Problem

Jiang Zhang, Shuqin Fan

Due to the advantages such as the worst-case hardness assumption, lattice-based cryptography is believed to the most promising research direction in post-quantum cryptography. As one of the two main hard problems commonly used in lattice-based cryptography, Learning With Errors (LWE) problem is widely used in constructing numerous cryptosystems. In order to improve the efficiency of lattice-based cryptosystems, Zhang et al. (2019) introduced the Asymmetric LWE (ALWE) problem. In this paper, the relation between the ALWE problem and the standard LWE problem is studied, and it shows that for certain error distributions the two problems are polynomially equivent, which paves the way for constructing secure lattice-based cryptosystems from the ALWE problem.

JOURNAL OF ELECTRONICS INFORMATION TECHNOLOGY•Feb 19, 2020•0 citations

Breaking Symmetric Cryptosystems Using Quantum Algorithms

Gaëtan Leurent

•Apr 29, 2017•0 citations
Due to the advantages such as the worst-case hardness assumption, lattice-based cryptography is believed to the most promising research direction in post-quantum cryptography. As one of the two main hard problems commonly used in lattice-based cryptography, Learning With Errors (LWE) problem is widely used in constructing numerous cryptosystems. In order to improve the efficiency of lattice-based cryptosystems, Zhang et al. (2019) introduced the Asymmetric LWE (ALWE) problem. In this paper, the relation between the ALWE problem and the standard LWE problem is studied, and it shows that for certain error distributions the two problems are polynomially equivent, which paves the way for constructing secure lattice-based cryptosystems from the ALWE problem.