Quantum cryptanalysis of hidden linear functions. (Extended abstract)
From MaRDI portal
Recommendations
Cited in
(40)- Quantum deduction rules
- Recursive information transducers: Computation models
- Testing the shift-equivalence of polynomials using quantum machines
- Testing shift-equivalence of polynomials by deterministic, probabilistic and quantum machines.
- Quantum model of computations: Underlying principles and achievements
- Hidden shift quantum cryptanalysis and implications
- Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3
- Quantum algorithm design: techniques and applications
- One complexity theorist's view of quantum computing
- Leveraging the hardness of dihedral coset problem for quantum cryptography
- Deterministic algorithms for the hidden subgroup problem
- General linear group action on tensors: a candidate for post-quantum cryptography
- Isogeny formulas for Jacobi intersection and twisted Hessian curves
- Quantum computing: survey and analysis
- The hidden subgroup problem and MKTP
- Quantum differential cryptanalysis
- Sample complexity of hidden subgroup problem
- Quantum algorithms for typical hard problems: a perspective of cryptanalysis
- Quantum public-key signature scheme based on asymmetric quantum encryption with trapdoor information
- Elementary quantum gates between long-distance qubits mediated by a resonator
- A combinatorial approach to quantum random functions
- New public key cryptosystems from combinatorial group theory
- On the arithmetic of the endomorphisms ring \(\text{End}(\mathbb Z_p\times\mathbb Z_{p^2})\).
- On the uselessness of quantum queries
- Computational indistinguishability between quantum states and its cryptographic application
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Key exchange protocols over noncommutative rings. The case of End(\(\mathbb Z_p \times \mathbb Z_{p^{2}}\))
- Quantum Random Walks – New Method for Designing Quantum Algorithms
- On quantum algorithms for noncommutative hidden subgroups
- Mathematical etudes on quantum computation
- Full quantum equivalence of group action DLog and CDH, and more
- Hidden stabilizers, the isogeny to endomorphism ring problem and the cryptanalysis of pSIDH
- Reduction of the semigroup-action problem on a module to the hidden-subgroup problem
- A simpler and more efficient reduction of DLog to CDH for abelian group actions
- Full quantum equivalence of group action DLog and CDH, and more
- Extending Regev's quantum algorithm to elliptic curves
- Quantum cryptanalysis of the KB-256 block cipher
- Searching hidden linear structures with quantum computer
- Exponential speedups for quantum walks in random hierarchical graphs
- Quantum computation with classical light: the Deutsch algorithm
This page was built for publication: Quantum cryptanalysis of hidden linear functions. (Extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4343414)
