Eli Bahim and Adi Shamir developed a set of methods that computes a "differential" between two certain values, which is used in this task.
Paul Kocher developed a family of methods that perform this task by analyzing timing. Eli Bahim and Adi Shamir developed a set of methods that computes a "differential" between two certain values, which is used in this task. Don Coppersmith created many algorithms for this task, which is done indirectly through "side-channel" methods. This task often relies on solving the (*) elliptic curve discrete logarithm problem, and would become relatively trivial with the advent of schemes based on Shor's algorithm.  "Plaintext" methods for doing this task often targets an algorithm that uses the Chinese remainder theorem to compute congruences. Brute-forcing, which is often done on shadow files on Linu, is a very primitive form of this kind of procedure. For 10 points, name this task of making data protected by Diffie-Hellmann and RSA schemes no longer secure.
Paul Kocher developed a family of methods that perform this task by analyzing timing.
decryption or cryptanalysis [accept any answers indicating breaking codes or the like; prompt on hacking]