I think it's because any information we gain about the Riemann Hypothesis (Lindelöf hypothesis is implied by RH) gives us information about the distribution of prime numbers. Any time you gain information about the distribution of prime numbers you immediately gain information that can be applied to any form of cryptography that makes use of prime numbers. You could use this information either to break existing forms of cryptography faster, or apply it to building newer and stronger cryptography.