Cryptography on programming
It's Hendrik Lenstra [to distinguish from Arjen Lenstra, both have worked on cryptography].

And, I am afraid I don't know how much the technical details in that article can be omitted, in the sense that only notation is defined and straightforward relationships are explored.

For example, clearly, a knapsack problem is exactly equivalent to an integer linear program.

And the problem finding integral points within a set, as on page 15, if one exists, is related to problems in more recent cryptographic structures such as those used in lattice based cryptography.