Compare Papers
Paper 1
Post-Quantum and Code-Based Cryptography—Some Prospective Research Directions
Chithralekha Balamurugan, Kalpana Singh, Ganeshvani Ganesan, Muttukrishnan Rajarajan
- Year
- 2021
- Journal
- Cryptography
- DOI
- 10.3390/cryptography5040038
- arXiv
- -
Cryptography has been used from time immemorial for preserving the confidentiality of data/information in storage or transit. Thus, cryptography research has also been evolving from the classical Caesar cipher to the modern cryptosystems, based on modular arithmetic to the contemporary cryptosystems based on quantum computing. The emergence of quantum computing poses a major threat to the modern cryptosystems based on modular arithmetic, whereby even the computationally hard problems which constitute the strength of the modular arithmetic ciphers could be solved in polynomial time. This threat triggered post-quantum cryptography research to design and develop post-quantum algorithms that can withstand quantum computing attacks. This paper provides an overview of the various research directions that have been explored in post-quantum cryptography and, specifically, the various code-based cryptography research dimensions that have been explored. Some potential research directions that are yet to be explored in code-based cryptography research from the perspective of codes is a key contribution of this paper.
Open paperPaper 2
A deceptive step towards quantum speedup detection
Salvatore Mandrà, Helmut G. Katzgraber
- Year
- 2017
- Journal
- arXiv preprint
- DOI
- arXiv:1711.01368
- arXiv
- 1711.01368
There have been multiple attempts to design synthetic benchmark problems with the goal of detecting quantum speedup in current quantum annealing machines. To date, classical heuristics have consistently outperformed quantum-annealing based approaches. Here we introduce a class of problems based on frustrated cluster loops - deceptive cluster loops - for which all currently known state-of-the-art classical heuristics are outperformed by the D-Wave 2000Q quantum annealing machine. While there is a sizable constant speedup over all known classical heuristics, a noticeable improvement in the scaling remains elusive. These results represent the first steps towards a detection of potential quantum speedup, albeit without a scaling improvement and for synthetic benchmark problems.
Open paper