Abstract
It is shown that the amount of computation required for a general cryptanalytic method is equivalent to an exhaustive search over the key space. In particular, any general time-memory tradeoff must do an exhaustive search as a part of the pre- or post-computation.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have