Estimating the Cost of Generic Quantum Pre-image Attacks on SHA-2 and SHA-3

@inproceedings{Amy2016EstimatingTC,
  title={Estimating the Cost of Generic Quantum Pre-image Attacks on SHA-2 and SHA-3},
  author={Matthew Amy and Olivia Di Matteo and Vlad Gheorghiu and Michele Mosca and Alex Parent and John M. Schanck},
  booktitle={SAC},
  year={2016}
}
  • Matthew Amy, Olivia Di Matteo, +3 authors John M. Schanck
  • Published in SAC 2016
  • Physics, Computer Science, Mathematics
  • We investigate the cost of Grover’s quantum search algorithm when used in the context of pre-image attacks on the SHA-2 and SHA-3 families of hash functions. Our cost model assumes that the attack is run on a surface code based fault-tolerant quantum computer. Our estimates rely on a time-area metric that costs the number of logical qubits times the depth of the circuit in units of surface code cycles. As a surface code cycle involves a significant classical processing stage, our cost estimates… CONTINUE READING

    Figures, Tables, and Topics from this paper.

    Explore key concepts

    Links to highly relevant papers for key concepts in this paper:

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 50 CITATIONS

    Time–space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2

    VIEW 6 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    Fault-Tolerant Resource Estimation of Quantum Random-Access Memories

    VIEW 4 EXCERPTS
    CITES METHODS & BACKGROUND

    Grover on SIMON

    VIEW 1 EXCERPT
    CITES METHODS

    Committing to quantum resistance: a slow defence for Bitcoin against a fast quantum computing attack

    VIEW 2 EXCERPTS
    CITES METHODS & BACKGROUND

    Quantum speedups for lattice sieves are tenuous at best

    VIEW 1 EXCERPT
    CITES BACKGROUND

    FILTER CITATIONS BY YEAR

    2016
    2020

    CITATION STATISTICS

    • 5 Highly Influenced Citations

    • Averaged 12 Citations per year from 2018 through 2020

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 36 REFERENCES

    A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits

    VIEW 10 EXCERPTS

    Towards practical classical processing for the surface code.

    VIEW 5 EXCERPTS
    HIGHLY INFLUENTIAL

    Polynomial-Time T-Depth Optimization of Clifford+T Circuits Via Matroid Partitioning

    VIEW 1 EXCERPT