Jeffrey C. Lagarias: Cryptography papers

• Knapsack Public Key Cryptosystems and Diophantine Approximation ,
  J. C. Lagarias,
  in: Advances in Cryptology: Proceedings of Crypto 83 , (D. Chaum, ed.), Plenum Press 1984, pp. 3-24.

• Evaluation of the Adleman attack on multiply iterated knapsack cryptosystems,
  E. F. Brickell, J. C. Lagarias, and A. M. Odlyzko,
  in: Advances in Cryptology: Proceedings of Crypto 83, (D. Chaum, ed.) Plenum Press, 1984, pp. 39-42.

• Performance analysis of Shamir's attack on the basic Merkle-Hellman knapsack cryptosystem ,
  J. C. Lagarias,
  in: ICALP 1984, Automata Languages and Programming, Eleventh Colloquium, Antwerp, Belgium, July 1984, Lecture Notes in Computer Science No. 172, Springer-Verlag: New York 1984, pp. 312-323.

• Solving low-density subset sum problems,
  J. C. Lagarias and A. M. Odlyzko,
  J. ACM, 32 (1985), pp. 229-246.
  [Preliminary version in Proc. 24th Annual Symposium on Foundations Computer Science ,IEEE Press 1983, pp. 1-10.]

• The computational complexity of simultaneous Diophantine approximation problems ,
  J. C. Lagarias,
  SIAM J. Computing 14 (1985), pp. 196-209.
  [Preliminary version in: Proc 23rd Annual Symposium on Foundations of Computer Science, IEEE Press 1982, pp. 32-39.]

• Linear congruential generators do not produce random sequences ,
  A. Frieze, R. Kannan, and J. C. Lagarias,
  Proc. 25th Annual Symposium on Foundations of Computer Science , IEEE Press 1984, pp. 480-484.

• One-way functions and circuit complexity ,
  R. Boppana and J. C. Lagarias,
  Information and Computation 74 (1987), pp. 226-240.
  [Preliminary version in: Structure in Complexity Theory ,
  Lecture Notes in Computer Science No. 223, Springer-Verlag: New York 1986, pp. 51-65.]

• Reconstructing truncated linear variables satisfying linear congruences ,
  A. Frieze, J. Hastad, R. Kannan, J. C. Lagarias, and A. Shamir,
  SIAM J. Computing 17 (1988), pp. 262-280.

• Unique Extrapolation of Polynomial Recurrences ,
  J. C Lagarias and J. A. Reeds,
  SIAM J. Computing 17 (1988), pp. 342-362.

• Polynomial time algorithms for finding integer relations among real numbers ,
  J. Hastad, B. Just, J. C. Lagarias and C. P. Schnorr,
  SIAM J. Computing 18 (1989), pp. 859-881. [Preliminary version in: STACS '86 , Lecture Notes in Computer Science No. 210, Springer-Verlag: New York 1986, pp. 105-118.]

• Pseudorandom number generators in number theory and cryptography ,
  J. C. Lagarias,
  in: Cryptology and Computational Number Theory ,
  (C. Pomerance, ed.), Proc. Symp. Applied Math. No. 42, AMS: Providence 1990, pp. 114-144.

• Probabilistic Algorithms for Speedup ,
  Joan Feigenbaum and Jeffrey C. Lagarias,
  Statistical Science 8 (1993), pp. 20-25.

• Pseudorandom Numbers ,
  Jeffrey C. Lagarias,
  Statistical Science 8 (1993), pp. 31-39.

• Point Lattices ,
  Jeffrey C. Lagarias,
  Chapter 19 in: Handbook of Combinatorics, Volume I
  (R. L. Graham, M. Gro"tschel and L. Lovasz, eds.), Elsevier Science B. V.: Amsterdam 1995, pp. 919-966.