2.5 Quantum Resistance of Signature Schemes & Hash Functions Flashcards
1
Q
Shor’s algorithm with powerful enough quantum computer can solve signature schemes based on
A
the integer factorization problem, the discrete logarithm problem or the elliptic curve discrete logarithm problem.
2
Q
Application of the 2nd pre-image resistance in message digests. How does it work?
A
It is not possible to generate the same hash with different contents. This, if the external service manipulates your data, the hash changes. With that, manipulation can be detected.
