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 Communications

Asymmetric cryptosystem and software design based on two-step phase-shifting interferometry and elliptic curve algorithm

Desheng Fan, Xiangfeng Meng, Yurong Wang, Xiulun Yang, Xiang Peng, Wenqi He, Guoyan Dong, Hongyi Chen

Published Jul 6, 2013• 6 citations
Publisher
DOI
10.1016/j.optcom.2013.06.044

Related papers

Single-channel optical color image cryptosystem using two-step phase-shifting interferometry and random modulus decomposition

Y. Xiong, Jiahui Du, Chenggen Quan

Optics & Laser Technology•May 29, 2019•15 citations

Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies

David Jao, Luca De Feo

Lecture notes in computer science•Jan 1, 2011•660 citations

Security enhancement of the phase-shifting interferometry-based cryptosystem by independent random phase modulation in each exposure

Meihua Liao, Wenqi He, Dajiang Lu +2 more

Optics and Lasers in Engineering•Mar 26, 2016•13 citations

Asymmetric cryptosystem by using modular arithmetic operation based on double random phase encoding

Wei Liu, Zhengjun Liu, Jingjing Wu +1 more

Optics Communications•Apr 18, 2013•25 citations

Constructing elliptic curve isogenies in quantum subexponential time

Andrew M. Childs, David Jao, Vladimir Soukharev

Abstract. Given two ordinary elliptic curves over a finite field having the same cardinality and endomorphism ring, it is known that the curves admit a nonzero isogeny between them, but finding such an isogeny is believed to be computationally difficult. The fastest known classical algorithm takes exponential time, and prior to our work no faster quantum algorithm was known. Recently, public-key cryptosystems based on the presumed hardness of this problem have been proposed as candidates for post-quantum cryptography. In this paper, we give a new subexponential-time quantum algorithm for constructing nonzero isogenies between two such elliptic curves, assuming the Generalized Riemann Hypothesis (but with no other assumptions). Our algorithm is based on a reduction to a hidden shift problem, and represents the first nontrivial application of Kuperberg's quantum algorithm for finding hidden shifts. This result suggests that isogeny-based cryptosystems may be uncompetitive with more mainstream quantum-resistant cryptosystems such as lattice-based cryptosystems. As part of this work, we also present the first classical algorithm for evaluating isogenies having provably subexponential running time in the cardinality of the base field under GRH.

arXiv:1012.4019•Journal of Mathematical Cryptology•Oct 23, 2013•245 citations

Cryptosystem based on two-step phase-shifting interferometry and the RSA public-key encryption algorithm

Xiangfeng Meng, Xiang Peng, Lutong Cai +3 more

A hybrid cryptosystem is proposed, in which one image is encrypted to two interferograms with the aid of double random-phase encoding (DRPE) and two-step phase-shifting interferometry (2-PSI), then three pairs of public–private keys are utilized to encode and decode the session keys (geometrical parameters, the second random-phase mask) and interferograms. In the stage of decryption, the ciphered image can be decrypted by wavefront reconstruction, inverse Fresnel diffraction, and real amplitude normalization. This approach can successfully solve the problem of key management and dispatch, resulting in increased security strength. The feasibility of the proposed cryptosystem and its robustness against some types of attack are verified and analyzed by computer simulations.

Journal of Optics A Pure and Applied Optics•May 8, 2009•23 citations
Abstract. Given two ordinary elliptic curves over a finite field having the same cardinality and endomorphism ring, it is known that the curves admit a nonzero isogeny between them, but finding such an isogeny is believed to be computationally difficult. The fastest known classical algorithm takes exponential time, and prior to our work no faster quantum algorithm was known. Recently, public-key cryptosystems based on the presumed hardness of this problem have been proposed as candidates for post-quantum cryptography. In this paper, we give a new subexponential-time quantum algorithm for constructing nonzero isogenies between two such elliptic curves, assuming the Generalized Riemann Hypothesis (but with no other assumptions). Our algorithm is based on a reduction to a hidden shift problem, and represents the first nontrivial application of Kuperberg's quantum algorithm for finding hidden shifts. This result suggests that isogeny-based cryptosystems may be uncompetitive with more mainstream quantum-resistant cryptosystems such as lattice-based cryptosystems. As part of this work, we also present the first classical algorithm for evaluating isogenies having provably subexponential running time in the cardinality of the base field under GRH.
A hybrid cryptosystem is proposed, in which one image is encrypted to two interferograms with the aid of double random-phase encoding (DRPE) and two-step phase-shifting interferometry (2-PSI), then three pairs of public–private keys are utilized to encode and decode the session keys (geometrical parameters, the second random-phase mask) and interferograms. In the stage of decryption, the ciphered image can be decrypted by wavefront reconstruction, inverse Fresnel diffraction, and real amplitude normalization. This approach can successfully solve the problem of key management and dispatch, resulting in increased security strength. The feasibility of the proposed cryptosystem and its robustness against some types of attack are verified and analyzed by computer simulations.