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

Annual Reviews in Control

A brief survey on encrypted control: From the first to the second generation and beyond

Nils Schlüter, Philipp Binfet, Moritz Schulze Darup

Published Jan 1, 2023• 28 citations
Publisher
DOI
10.1016/j.arcontrol.2023.100913

Related papers

Unclonable Encryption, Revisited

Prabhanjan Ananth, Fatih Kaleoglu

arXiv:2103.15009•Lecture notes in computer science•Jan 1, 2021•34 citations

A survey on functional encryption

Carla Mascia, Massimiliano Sala, Irène Villa

Functional Encryption (FE) expands traditional public-key encryption in two different ways: it supports fine-grained access control and allows learning a function of the encrypted data. In this paper, we review all FE classes, describing their functionalities and main characteristics. In particular, we mention several schemes for each class, providing their security assumptions and comparing their properties. To our knowledge, this is the first survey that encompasses the entire FE family.

arXiv:2106.06306•Advances in Mathematics of Communications•Oct 27, 2021•19 citations

SOME COMMENTS ON THE ONE-DIMENSIONAL MANY-BODY PROBLEM.

Élliott H. Lieb

In the first half, the implication and significance of one dimensional models for many-body physics is discussed. In the second part, a brief historical survey is given of existing models and results obtained to date. (Author)

•Jan 1, 1965•0 citations

On the Feasibility of Unclonable Encryption, and More

Prabhanjan Ananth, Fatih Kaleoglu, Xingjian Li +2 more

arXiv:2207.06589•Lecture notes in computer science•Jan 1, 2022•42 citations

Quantum Image Encryption Using a Self-Adaptive Hash Function-Controlled Chaotic Map (SAHF-CCM)

Roayat Ismail Abdelfatah

Recently, quantum image encryption algorithms are attracting more and more attention, due to the upcoming quantum threat problem to the current cryptographic encryption algorithms with the rapid progress toward the quantum computer production. The aim of this paper is to introduce a self-adaptive encryption scheme to protect quantum image efficiently with minimal storage requirements. The methodology is to use two rounds of encryption with two different pseudorandom number sequences which are obtained from a new designed pseudorandom number generator (PRNG). This PRNG consists of two parts. The first part is based on iterating a recently proposed chaotic-based parallel keyed hash function which is used as a controller for a second part. The second part is a multiplication of Tent and Chebyshev chaotic maps (TCM). This combination of hash function and chaotic maps provides high randomness and a dramatical increase in the control parameters and initial values number which achieves extremely large key space and so makes the scheme stronger against brute force attacks. The seed or initial value of PRNG depends on the input image itself which makes the scheme self-adaptive and so it is stronger against chosen plaintext attacks and known-plaintext attacks. In the first round of encryption, the value of each pixel qubits of the input image is changed to a new value by XORing it with the corresponding qubits of the first pseudorandom sequence using CNOT and Toffoli quantum gates then shifting to the next qubit with the Swap quantum gate. In this round, the pixel value is changed. In the second round, diffusion of the changed pixel value is extended to each pixel in the input image using the second pseudorandom sequence and Toffoli quantum gates. The time complexity of the proposed scheme is less than many recently published quantum image encryption schemes. The scheme security analysis is discussed, and the experimental results proved that the scheme is robust, secure and efficient.

IEEE Access•Jan 1, 2022•30 citations

Robust Encryption, Revisited

Pooya Farshim, Benoît Libert, Kenneth G. Paterson +1 more

Lecture notes in computer science•Jan 1, 2013•38 citations
Recently, quantum image encryption algorithms are attracting more and more attention, due to the upcoming quantum threat problem to the current cryptographic encryption algorithms with the rapid progress toward the quantum computer production. The aim of this paper is to introduce a self-adaptive encryption scheme to protect quantum image efficiently with minimal storage requirements. The methodology is to use two rounds of encryption with two different pseudorandom number sequences which are obtained from a new designed pseudorandom number generator (PRNG). This PRNG consists of two parts. The first part is based on iterating a recently proposed chaotic-based parallel keyed hash function which is used as a controller for a second part. The second part is a multiplication of Tent and Chebyshev chaotic maps (TCM). This combination of hash function and chaotic maps provides high randomness and a dramatical increase in the control parameters and initial values number which achieves extremely large key space and so makes the scheme stronger against brute force attacks. The seed or initial value of PRNG depends on the input image itself which makes the scheme self-adaptive and so it is stronger against chosen plaintext attacks and known-plaintext attacks. In the first round of encryption, the value of each pixel qubits of the input image is changed to a new value by XORing it with the corresponding qubits of the first pseudorandom sequence using CNOT and Toffoli quantum gates then shifting to the next qubit with the Swap quantum gate. In this round, the pixel value is changed. In the second round, diffusion of the changed pixel value is extended to each pixel in the input image using the second pseudorandom sequence and Toffoli quantum gates. The time complexity of the proposed scheme is less than many recently published quantum image encryption schemes. The scheme security analysis is discussed, and the experimental results proved that the scheme is robust, secure and efficient.