On post-quantum security of symmetric cryptosystems

Abstract

Since Shor discovered polynomial time quantum algorithms to solve integer factorization and discrete logarithm problems, lots of studies have been done on post-quantum public key cryptography. In recent years, some interesting attacks using quantum computers have been found on not only public key schemes but also symmetric key schemes. This article provides an overview of the history and recent trends in research on the post-quantum security of symmetric key schemes, mainly in terms of cryptanalysis.