Fetching the paper…
Reading the bibliography…
The key cryptographic protocols used to secure the internet and financial transactions of today are all susceptible to attack by the development of a sufficiently large quantum computer.
Random oracles are practical: A paradigm for designing efficient protocols
Mihir Bellare and Phillip Rogaway · 1993
Earlier work this paper cites.
Large provably fast and secure digital signature schemes based on secure hash functions, July 11 1995
Frank T Leighton and Silvio Micali · 1995
Earlier work this paper cites.
A fast quantum mechanical algorithm for database search
Lov K. Grover · 1996
Earlier work this paper cites.
Strengths and weaknesses of quantum computing
C.H. Bennett, E. Bernstein, G. Brassard, and U. Vazirani · 1997
Earlier work this paper cites.
Tight bounds on quantum searching
Michel Boyer, Gilles Brassard, Peter Høyer, and Alain Tapp · 1998
Earlier work this paper cites.
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
Peter W. Shor · 1999
Earlier work this paper cites.
Generalized quantum search with parallelism
Robert M. Gingrich, Colin P. Williams, and Nicolas J. Cerf · 2000
Earlier work this paper cites.
How to achieve a mceliece-based digital signature scheme
Nicolas Courtois, Matthieu Finiasz, and Nicolas Sendrier · 2001
Earlier work this paper cites.
Quartz, 128-bit long digital signatures
Jacques Patarin, Nicolas Courtois, and Louis Goubin · 2001
Earlier work this paper cites.
Hashcash–a denial of service counter-measure, 2002
Adam Back · 2002
Earlier work this paper cites.
Quantum lower bounds for the collision and the element distinctness problems
S. Aaronson and Y. Shi · 2004
Earlier work this paper cites.
Rainbow, a new multivariable polynomial signature scheme
Jintai Ding and Dieter Schmidt · 2005
Earlier work this paper cites.
One-time signatures revisited: Have they become practical?
Dalit Naor, Amir Shenhav, and Avishai Wool · 2005
Earlier work this paper cites.
Learning a parallelepiped: Cryptanalysis of ggh and ntru signatures
Phong Q Nguyen and Oded Regev · 2006
Earlier work this paper cites.
Quantum walk algorithm for element distinctness
A. Ambainis · 2007
Earlier work this paper cites.
Trapdoors for hard lattices and new cryptographic constructions
Craig Gentry, Chris Peikert, and Vinod Vaikuntanathan · 2008
Earlier work this paper cites.
Quantum algorithm for linear systems of equations
Aram W. Harrow, Avinatan Hassidim, and Seth Lloyd · 2009
Earlier work this paper cites.
Bitcoin: A peer-to-peer electronic cash system, 2009
Satoshi Nakamoto · 2009
Earlier work this paper cites.
Fault tolerance with noisy and slow measurements and preparation
Gerardo A. Paz-Silva, Gavin K. Brennen, and Jason Twamley · 2010
Cited alongside, same era.
XMSS–a practical forward secure signature scheme based on minimal security assumptions
Johannes Buchmann, Erik Dahmen, and Andreas Hülsing · 2011
Cited alongside, same era.
Ultra-low-power superconductor logic
Quentin P. Herr, Anna Y. Herr, Oliver T. Oberg, and Alexander G. Ioannidis · 2011
Cited alongside, same era.
Learning a zonotope and more: Cryptanalysis of ntrusign countermeasures
Léo Ducas and Phong Q Nguyen · 2012
Cited alongside, same era.
Surface codes: Towards practical large-scale quantum computation
Austin G. Fowler, Matteo Mariantoni, John M. Martinis, and Andrew N. Cleland · 2012
Cited alongside, same era.
Practical lattice-based cryptography: A signature scheme for embedded systems
Tim Güneysu, Vadim Lyubashevsky, and Thomas Pöppelmann · 2012
Quantum linear systems algorithm with exponentially improved dependence on precision
Andrew M Childs, Robin Kothari, and Rolando Somma · 2015
Later among the works it cites.
Demonstration of a quantum error detection code using a square lattice of four superconducting qubits
A.D. Córcoles, Easwar Magesan, Srikanth J. Srinivasan, Andrew W. Cross, M. Steffen, Jay M. Gambetta, and Jerry M. Chow · 2015
Later among the works it cites.
Reversible circuit compilation with space constraints
Alex Parent, Martin Rötteler, and Krysta Marie Svore · 2015
Later among the works it cites.
Cuckoo cycle: a memory bound graph-theoretic proof-of-work
John Tromp · 2015
Later among the works it cites.
Improved error thresholds for measurement-free error correction
Daniel Crow, Robert Joynt, and M. Saffman · 2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Lattice signatures without trapdoors
Vadim Lyubashevsky · 2012
Cited alongside, same era.
Ultrafast quantum gates in circuit qed
G. Romero, D. Ballester, Y. M. Wang, V. Scarani, and E. Solano · 2012
Cited alongside, same era.
Process verification of two-qubit quantum gates by randomized benchmarking
A. D. Córcoles, Jay M. Gambetta, Jerry M. Chow, John A. Smolin, Matthew Ware, Joel Strand, B. L. T. Plourde, and M. Steffen · 2013
Cited alongside, same era.
Lattice signatures and bimodal gaussians
Léo Ducas, Alain Durmus, Tancrède Lepoint, and Vadim Lyubashevsky · 2013
Cited alongside, same era.
Universal fault-tolerant quantum computation with only transversal gates and error correction
Adam Paetznick and Ben W. Reichardt · 2013
Cited alongside, same era.
Quantum circuits of $t$-depth one
Peter Selinger · 2013
Cited alongside, same era.
Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3
Amy Matthew, Olivia Di Matteo, Vlad Gheorghiu, Michele Mosca, Alex Parent, and John Schanck · 2016
Later among the works it cites.
Procedure for systematically tuning up cross-talk in the cross-resonance gate
Sarah Sheldon, Easwar Magesan, Jerry M. Chow, and Jay M. Gambetta · 2016
Later among the works it cites.
Equihash: Asymmetric proof-of-work based on the generalized birthday problem
Alex Biryukov and Dmitry Khovratovich · 2017
Closest in time.
Robustness of error-suppressing entangling gates in cavity-coupled transmon qubits
Xiu-Hao Deng, Edwin Barnes, and Sophia E. Economou · 2017
Closest in time.
Crystals–dilithium: Digital signatures from module lattices
Léo Ducas, Tancrède Lepoint, Vadim Lyubashevsky, Peter Schwabe, Gregor Seiler, and Damien Stehlé · 2017
Closest in time.
https://www.newscientist.com/article/2138373-google-on-track-for-quantum-computer-breakthrough-by-end-of-2017/
2017
Closest in time.
A quantum “magic box” for the discrete logarithm problem
B. S. Jr. Kaliski · 2017
Closest in time.
Revisiting lattice attacks on overstretched NTRU parameters
Paul Kirchner and Pierre-Alain Fouque · 2017
Closest in time.
Optimized cross-resonance gate for coupled transmon systems
S Kirchhoff, T Kessler, PJ Liebermann, E Assemat, S Machnes, F Motzoi, and FK Wilhelm · 2017
Closest in time.
To BLISS-B or not to be—attacking strongswan’s implementation of post-quantum signatures
Peter Pessl, Leon Groot Bruinderink, and Yuval Yarom · 2017
Closest in time.
Quantum resource estimates for computing elliptic curve discrete logarithms
M Roetteler, M Naehrig, K.M. Svore, and K Lauter · 2017
Closest in time.
Concrete resource analysis of the quantum linear-system algorithm used to compute the electromagnetic scattering cross section of a 2d target
Artur Scherer, Benoît Valiron, Siun-Chuon Mau, Scott Alexander, Eric van den Berg, and Thomas E. Chapuran · 2017
Closest in time.
Smart contracts make bitcoin mining pools vulnerable
Y Velner, J Teutsch, and L Luu · 2017
Closest in time.