Your browser doesn't support javascript.
loading
Mostrar: 20 | 50 | 100
Resultados 1 - 2 de 2
Filtrar
Mais filtros

Base de dados
Ano de publicação
Tipo de documento
Intervalo de ano de publicação
1.
Entropy (Basel) ; 24(2)2022 Feb 08.
Artigo em Inglês | MEDLINE | ID: mdl-35205545

RESUMO

This paper proposes an image encryption scheme based on logistic quantum chaos. Firstly, we use compressive sensing algorithms to compress plaintext images and quantum logistic and Hadamard matrix to generate the measurement matrix. Secondly, the improved flexible representation of the quantum images (FRQI) encoding method is utilized for encoding the compressed image. The pixel value scrambling operation of the encoded image is realized by rotating the qubit around the axis. Finally, the quantum pixel is encoded into the pixel value in the classical computer, and the bit-level diffusion and scrambling are performed on it. Numerical analysis and simulation results show that our proposed scheme has the large keyspace and strong key sensitivity. The proposed scheme can also resist standard attack methods such as differential attacks and statistical analysis.

2.
Entropy (Basel) ; 24(11)2022 Oct 24.
Artigo em Inglês | MEDLINE | ID: mdl-36359612

RESUMO

As the foundation of quantum secure communication, the quantum key distribution (QKD) network is impossible to construct by using the operation mechanism of traditional networks. In the meantime, most of the existing QKD network routing schemes do not fit some specific quantum key practicality scenarios. Aiming at the special scenario of high concurrency and large differences in application requirements, we propose a new quantum key distribution network routing scheme based on application priority ranking (APR-QKDN). Firstly, the proposed APR-QKDN scheme comprehensively uses the application's priority, the total amount of key requirements, and the key update rate for prioritizing a large number of concurrent requests. The resource utilization and service efficiency of the network are improved by adjusting the processing order of requests. Secondly, the queuing strategy of the request comprehensively considers the current network resource situation. This means the same key request may adopt different evaluation strategies based on different network resource environments. Finally, the performance of the APR-QKDN routing scheme is compared with the existing schemes through simulation experiments. The results show that the success rate of application key requests of the APR-QKDN routing scheme is improved by at least 5% in the scenario of high concurrency.

SELEÇÃO DE REFERÊNCIAS
DETALHE DA PESQUISA