A public key cryptosystem based on data complexity under quantum environment
From MaRDI portal
Publication:5046478
DOI10.1007/s11432-015-5408-5zbMath1497.94128OpenAlexW2181396417MaRDI QIDQ5046478
WanQing Wu, Houzhen Wang, Huanguo Zhang, JinHui Liu, Shaowu Mao, JianWei Jia
Publication date: 28 October 2022
Published in: Science China Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11432-015-5408-5
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extended multivariate public key cryptosystems with secure encryption function
- Differential cryptanalysis of DES-like cryptosystems
- Improved construction of LDPC convolutional codes with semi-random parity-check matrices
- Quantum algorithm to find invariant linear structure of \(MD\) hash functions
- Polynomial-time quantum algorithms for finding the linear structures of Boolean function
- Symmetric-key cryptosystem with DNA technology
- Quantum Computation and Quantum Information
- Tensor rank is NP-complete
- Protecting Information
- Rapid solution of problems by quantum computation
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- On the Power of Quantum Computation
- Quantum Complexity Theory
- Strengths and Weaknesses of Quantum Computing
- Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
- Realizable Universal Quantum Logic Gates
- Demonstration of a Fundamental Quantum Logic Gate
- The Hidden Subgroup Problem and Quantum Computation Using Group Representations
- Construction of minimal trellises for quantum stabilizer codes
- Batch proxy quantum blind signature scheme
- Asymmetric encryption and signature method with DNA technology
- Mixed-state entanglement and quantum error correction
- Most Tensor Problems Are NP-Hard
This page was built for publication: A public key cryptosystem based on data complexity under quantum environment
