Quantum-Secure Symmetric-Key Cryptography Based on Hidden Shifts

DOI10.1007/978-3-319-56617-7_3zbMath1394.94924arXiv1610.01187OpenAlexW3103443545MaRDI QIDQ5270358

Alexander Russell, Gorjan Alagic

Publication date: 23 June 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1610.01187

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

On tight quantum security of HMAC and NMAC in the quantum random oracle model, Noisy Simon period finding, Свойства регулярных представлений неабелевых $2$-групп с циклической подгруппой индекса $2$, Post-quantum security of the Even-Mansour cipher, Complete analysis of Simon's quantum algorithm with additional collisions, Quantum security of grain-128/grain-128a stream cipher against HHL algorithm, Quantum linearization attacks, Redeeming reset indifferentiability and applications to post-quantum security, QCB: efficient quantum-secure authenticated encryption, Quantum attacks on Lai-Massey structure, Sponge-based authenticated encryption: security against quantum attackers, On quantum ciphertext indistinguishability, recoverability, and OAEP, Zero sum subsequences and hidden subgroups, Quantum key-recovery on full AEZ, Breaking LWC candidates: sESTATE and Elephant in quantum setting, Leveraging the hardness of dihedral coset problem for quantum cryptography, Простейшие надгруппы регулярных представлений неабелевых $2$-групп с циклической подгруппой индекса $2$, Обобщенные квази-адамаровы преобразования на конечных группах, Quantum indistinguishability for public key encryption

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A construction of a cipher from a single pseudorandom permutation.
• Slidex attacks on the Even-Mansour encryption scheme
• The quantum query complexity of the hidden subgroup problem is polynomial
• Breaking Symmetric Cryptosystems Using Quantum Period Finding
• Secure Identity-Based Encryption in the Quantum Random Oracle Model
• Another Subexponential-time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
• The Symmetric Group Defies Strong Fourier Sampling
• How to Construct Pseudorandom Permutations from Pseudorandom Functions
• On the Power of Quantum Computation
• Quantum Computation and Lattice Problems
• Quantum-Secure Message Authentication Codes
• ON THE COMPLEXITY OF THE HIDDEN SUBGROUP PROBLEM
• Quantum Algorithms for Abelian Difference Sets and Applications to Dihedral Hidden Subgroups
• Constructing elliptic curve isogenies in quantum subexponential time
• Hidden Translation and Translating Coset in Quantum Computing
• The security of all RSA and discrete log bits
• A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
• Quantum rejection sampling
• Limitations of quantum coset states for graph isomorphism
• On lattices, learning with errors, random linear codes, and cryptography