Noisy Simon period finding
From MaRDI portal
Publication:826245
DOI10.1007/978-3-030-75539-3_4zbMath1483.81044arXiv1910.00802OpenAlexW3165758468MaRDI QIDQ826245
Jonathan Schwinger, Alexander May, Lars Schlieper
Publication date: 20 December 2021
Full work available at URL: https://arxiv.org/abs/1910.00802
Quantum computation (81P68) Cryptography (94A60) White noise theory (60H40) Reliability, testing and fault tolerance of networks and computer systems (68M15) Computational stability and error-correcting codes for quantum computation and communication processing (81P73)
Related Items (1)
Cites Work
- Unnamed Item
- Noisy Simon period finding
- Hidden shift quantum cryptanalysis and implications
- LPN decoded
- The \textsf{Simeck} family of lightweight block ciphers
- Grover meets Simon -- quantumly attacking the FX-construction
- Quantum key-recovery on full AEZ
- Dissection-BKW
- Quantum attacks without superposition queries: the offline Simon's algorithm
- Cryptanalysis against symmetric-key schemes with online classical queries and offline quantum computations
- Breaking Symmetric Cryptosystems Using Quantum Period Finding
- Secure Signatures and Chosen Ciphertext Security in a Quantum Computing World
- Solving LPN Using Covering Codes
- An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices
- Quantum Error Correction and Orthogonal Geometry
- Quantum-Secure Symmetric-Key Cryptography Based on Hidden Shifts
- Noise-tolerant learning, the parity problem, and the statistical query model
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Noisy Simon period finding
