A public key cryptosystem based on data complexity under quantum environment
From MaRDI portal
Publication:5046478
Cites work
- scientific article; zbMATH DE number 708826 (Why is no real title available?)
- scientific article; zbMATH DE number 1759776 (Why is no real title available?)
- scientific article; zbMATH DE number 854547 (Why is no real title available?)
- Asymmetric encryption and signature method with DNA technology
- Batch proxy quantum blind signature scheme
- Construction of minimal trellises for quantum stabilizer codes
- Demonstration of a Fundamental Quantum Logic Gate
- Differential cryptanalysis of DES-like cryptosystems
- Extended multivariate public key cryptosystems with secure encryption function
- Improved construction of LDPC convolutional codes with semi-random parity-check matrices
- Mixed-state entanglement and quantum error correction
- Most tensor problems are NP-hard
- On the Power of Quantum Computation
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Polynomial-time quantum algorithms for finding the linear structures of Boolean function
- Protecting Information
- Quantum Complexity Theory
- Quantum Vernam cipher
- Quantum algorithm to find invariant linear structure of \(MD\) hash functions
- Quantum computation and quantum information. 10th anniversary edition
- Rapid solution of problems by quantum computation
- Realizable Universal Quantum Logic Gates
- Strengths and Weaknesses of Quantum Computing
- Symmetric-key cryptosystem with DNA technology
- Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
- Tensor rank is NP-complete
- The Hidden Subgroup Problem and Quantum Computation Using Group Representations
This page was built for publication: A public key cryptosystem based on data complexity under quantum environment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5046478)
