Andrew Odlyzko: Papers on Cryptography and Security

• Cybersecurity is not very important, A. Odlyzko. ACM Ubiquity, June 2019, pp. 1-23. [online journal version] [preprint, PDF]

• The past, evolving present and future of discrete logarithm, A. Joux, A. Odlyzko, and C. Pierrot, Open Problems in Mathematical and Computational Sciences, C. K. Koc, ed., Springer, 2014, pp. 5-36. [preprint, PDF]

• Collaborating with the enemy on network management, C. Hall, D. Yu, Z.-L. Zhang, J. Stout, A. Odlyzko, A. W. Moore, J. Camp, K. Benton, and R. Anderson, Security Protocols XXII, B. Christianson, J. Malcolm, V. Matyas, P. Svenda, F. Stajano, and J. Anderson, eds., Lecture Notes in Computer Science No. 8809, Springer, 2014, pp. 154-162. [preprint, PDF]

• Discrete logarithms over finite fields, A. Odlyzko. In Handbook of Finite Fields, G. Mullen and D. Panario, eds., CRC Press, 2013, pp. 393-401. [preprint, PDF]

• Providing security with insecure systems, A. Odlyzko. Extended abstract. WiSec'10: Proceedings of the Third ACM Conference on Wireless Network Security, ACM, 2010, pp. 87-88. [PDF]

• Index calculation attacks on RSA signature and encryption, J.-S. Coron, Y. Desmedt, D. Naccache, A. Odlyzko, and J. P. Stern, Designs, Codes, and Cryptography, vol. 38, no. 1, Jan. 2006, pp. 41-53. [PDF]

• The unsolvable privacy problem and its implications for security technologies, A. M. Odlyzko. Information Security and Privacy: 8th Australasian Conference, ACISP 2003, R. Safavi-Naini and J. Seberry, eds., Lecture Notes in Computer Science #2727, Springer, 2003, pp. 51-54. [PDF] [text]

• The case against micropayments, A. M. Odlyzko. Financial Cryptography: 7th International Conference, FC 2003, R. N. Wright, ed., Lecture Notes in Computer Science #2742, Springer, 2003, pp. 77-83. [PDF] [text]

• Economics, psychology, and sociology of security, A. M. Odlyzko. Financial Cryptography: 7th International Conference, FC 2003, R. N. Wright, ed., Lecture Notes in Computer Science #2742, Springer, 2003, pp. 182-189. [PDF] [text]

• Mathematics, cryptology, and technology, A. M. Odlyzko. Foreward to Public-Key Cryptography and Computational Number Theory, K. Alster, J. Urbanowicz, and H. C. Williams, eds., Walter de Gruyter, 2001, pp. ix-x. [preprint, text]

• Cryptographic abundance and pervasive computing, A. M. Odlyzko. iMP: Information Impacts Magazine, June 2000. [text] [iMP version at Wayback Machine]

• Discrete logarithms: The past and the future, A. M. Odlyzko, Designs, Codes, and Cryptography 19 (2000), pp. 129-145. Reprinted in Towards a Quarter-Century of Public Key Cryptography, N. Koblitz, ed., Kluwer, 2000, pp. 59-75. [Abstract] [PDF]

• Attacks on Shamir's 'RSA for paranoids', H. Gilbert, D. Gupta, A. M. Odlyzko, and J.-J. Quisquater, Information Processing Letters 68 (1998), pp. 197-199. [PDF]

• An efficient micropayment system based on probabilistic polling, S. Jarecki and A. M. Odlyzko, in Financial Cryptography, R. Hirschfeld, ed., Lecture Notes in Computer Science #1318, Springer, 1997, pp. 173-191. [PDF]

• The future of integer factorization, A. M. Odlyzko, CryptoBytes (The technical newsletter of RSA Laboratories) 1 (no. 2) (1995), pp. 5-12. [PDF] [CryptoBytes issue]

• Discrete logarithms and smooth polynomials, A. M. Odlyzko, pp. 269-278 in Finite Fields: Theory, Applications and Algorithms, G. L. Mullen and P. Shiue, eds., Amer. Math. Soc., Contemporary Math. #168 (1994). [PDF]

• Public key cryptography, A. M. Odlyzko, AT&T Tech. J., 73:5 (Sept.-Oct. 1994), pp. 17-23. [PDF]

• Improved low-density subset sum algorithms, M. J. Coster, A. Joux, B. A. LaMacchia, A. M. Odlyzko, C. P. Schnorr, and J. Stern, Computational Complexity, 2 (1992), pp. 111-128. [PDF]

• An improved low-density subset sum algorithm, M. J. Coster, B. A. LaMacchia, A. M. Odlyzko, and C. P. Schnorr, pp. 54-67 in Advances in Cryptology - EUROCRYPT '91, D. W. Davies (ed.), Springer Verlag, Lecture Notes in Computer Science #547 (1991). [PDF]

• Computation of discrete logarithms in prime fields, B. A. LaMacchia and A. M. Odlyzko, Designs, Codes, and Cryptography, 1 (1991), pp. 46-62, Extended abstract in Advances in Cryptology - CRYPTO '90, A. J. Menezes, and S. A. Vanstone (eds.), Springer Verlag, Lecture Notes in Computer Science #537, 1991, pp. 616-618. [PDF]

• Solving large sparse linear systems over finite fields, B. A. LaMacchia and A. M. Odlyzko, pp. 109-133 in Advances in Cryptology - CRYPTO '90, A. J. Menezes and S. A. Vanstone (eds.), Springer Verlag, Lecture Notes in Computer Science #537 (1991). [PDF]

• Cryptanalysis: A survey of recent results, E. F. Brickell and A. M. Odlyzko, pp. 501-540 in Contemporary Cryptology, G. J. Simmons (ed.), IEEE Press (1991). Preliminary version in Proc. IEEE 76, 1988, pp. 578-593. [PDF]

• The rise and fall of knapsack cryptosystems, A. M. Odlyzko, pp. 75-88 in Cryptology and Computational Number Theory, C. Pomerance (ed.), Am. Math. Soc., Proc. Symp. Appl. Math. #42 (1990). [PDF]

• Random mapping statistics, P. Flajolet and A. M. Odlyzko, pp. 329-354 in Advances in Cryptology - EUROCRYPT '89, J.-J. Quisquater and J. Vandewalle (eds.), Springer Verlag, Lecture Notes in Computer Science #434 (1990). [PDF]

• Advances in cryptology - CRYPTO '86, A. M. Odlyzko, ed., Springer Verlag, Lecture Notes in Computer Science #263, 1987.

• On the complexity of computing discrete logarithms and factoring integers, A. M. Odlyzko, pp. 113-116 in Open Problems in Communication and Computation, T. M. Cover and B. Gopinath (eds.), Springer, 1987. [PDF]

• A chosen text attack on the RSA cryptosystem and some discrete logarithm schemes, Y. Desmedt and A. M. Odlyzko, pp. 516-522 in Advances in Cryptology - CRYPTO '85, H. C. Williams (ed.), Springer Verlag, Lecture Notes in Computer Science #218, 1986. [PDF]

• Discrete logarithms in GF(p), D. Coppersmith, A. M. Odlyzko, and R. Schroeppel, Algorithmica, 1 (1986), pp. 1-15.

• Fast cryptanalysis of the Matsumoto-Imai public key scheme, P. Delsarte, Y. Desmedt, A. Odlyzko, and P. Piret, pp. 142-149 in Advances in Cryptology: Proceedings of EUROCRYPT 84, T. Beth, N. Cot, and I. Ingemarsson (eds.), Springer-Verlag, Lecture Notes in Computer Science #209, 1985. [PDF]

• Discrete logarithms in finite fields and their cryptographic significance , A. M. Odlyzko, pp. 224-314 in Advances in Cryptology: Proceedings of EUROCRYPT 84, T. Beth, N. Cot, and I. Ingemarsson (eds.), Springer-Verlag, Lecture Notes in Computer Science #209, 1985. [PDF]

• 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 IEEE Foundations Computer Science Symp., pp. 1-10, 1983.

• Cryptanalytic attacks on the multiplicative knapsack cryptosystem and on Shamir's signature scheme, A. M. Odlyzko, IEEE Trans. Information Theory, IT-30 (1984), pp. 594-601. [PDF]

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