Andrew M. Odlyzko

  • University of Minnesota, USA

According to our database1, Andrew M. Odlyzko authored at least 118 papers between 1973 and 2022.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.



In proceedings 
PhD thesis 


Online presence:



Workings of science: Trust in science and mathematics.
Ubiquity, 2022

Cybersecurity is not very important.
Ubiquity, 2019

An interview with Andrew Odlyzko on cyber security.
Commun. ACM, 2019

The glorious promise of the post-truth world.
Ubiquity, 2017

Genome-Scale Metabolic Network Validation of <i>Shewanella oneidensis</i> Using Transposon Insertion Frequency Analysis.
PLoS Comput. Biol., 2014

Collaborating with the Enemy on Network Management.
Proceedings of the Security Protocols XXII, 2014

The Past, Evolving Present, and Future of the Discrete Logarithm.
Proceedings of the Open Problems in Mathematics and Computational Science, 2014

Open Access, library and publisher competition, and the evolution of general commerce
CoRR, 2013

Discrete logarithms over finite fields.
Proceedings of the Handbook of Finite Fields., 2013

The zeta function on the critical line: Numerical evidence for moments and random matrix theory models.
Math. Comput., 2012

Web history and economics.
Comput. Networks, 2012

Review: Experimental Mathematics in Action. A K Peters, Wellesley, MA, 2007. xii + 322 pp., ISBN 978-1-56881-271-7. $65. by D. H. Bailey, J. M. Borwein, N. J. Calkin, R. Girgensohn, D. R. Luke, and V. H. Moll.
Am. Math. Mon., 2011

Economics, QoS, and Charging in the Next Great Telecom Revolution.
Proceedings of the Economics of Converged, Internet-Based Networks, 2011

Internet Predictions.
IEEE Internet Comput., 2010

Bubbles, gullibility, and other challenges for economics, psychology, sociology, and information sciences.
First Monday, 2010

Social networks and mathematical models: A research commentary on "Critical Mass and Willingness to Pay for Social Networks" by J. Christopher Westland.
Electron. Commer. Res. Appl., 2010

Providing security with insecure systems.
Proceedings of the Third ACM Conference on Wireless Network Security, 2010

Interactions, Competition and Innovation in a Service-Oriented Internet: An Economic Model.
Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

Economics and technology in the evolution of networks.
Proceedings of the 42nd Annual Conference on Information Sciences and Systems, 2008

Digital rights management: desirable, inevitable, and almost irrelevant.
Proceedings of the Seventh ACM Workshop on Digital Rights Management, 2007

Privacy and the clandestine evolution of e-commerce.
Proceedings of the 9th International Conference on Electronic Commerce: The Wireless World of Electronic Commerce, 2007

Index Calculation Attacks on RSA Signature and Encryption.
Des. Codes Cryptogr., 2006

Privacy, Economics, and Price Discrimination on the Internet.
Proceedings of the Economics of Information Security, 2004

The many paradoxes of broadband.
First Monday, 2003

Does Anyone Really Need MicroPayments?
Proceedings of the Financial Cryptography, 2003

Economics, Psychology, and Sociology of Security.
Proceedings of the Financial Cryptography, 2003

The Case Against Micropayments.
Proceedings of the Financial Cryptography, 2003

The Unsolvable Privacy Problem and Its Implications for Security Technologies.
Proceedings of the Information Security and Privacy, 8th Australasian Conference, 2003

Privacy, economics, and price discrimination on the Internet.
Proceedings of the 5th International Conference on Electronic Commerce, 2003

The rapid evolution of scholarly communication.
Learn. Publ., 2002

Content is Not King.
First Monday, 2001

Internet pricing and the history of communications.
Comput. Networks, 2001

An improved bound for the de Bruijn-Newman constant.
Numer. Algorithms, 2000

The Internet and other networks: utilization rates and their implications.
Inf. Econ. Policy, 2000

Dynamic behavior of differential pricing and quality of service options for the internet.
Decis. Support Syst., 2000

Discrete Logarithms: The Past and the Future.
Des. Codes Cryptogr., 2000

Keynote Talk: Internet Charging.
Proceedings of the Quality of Future Internet Services, 2000

Integer Factorization and Discrete Logarithms (Abstract).
Proceedings of the LATIN 2000: Theoretical Informatics, 2000

Letters to the Editor.
First Monday, 1999

The Visible Problems of the Invisible Computer: A Skeptical Look at Information Appliances.
First Monday, 1999

Jumping Champions.
Exp. Math., 1999

Competition and cooperation: Libraries and publishers in the transition to electronic scholarly journals
CoRR, 1999

The Asymptotic Number of Set Partitions with Unequal Block Sizes.
Electron. J. Comb., 1999

Paris metro pricing for the internet.
Proceedings of the First ACM Conference on Electronic Commerce (EC-99), 1999

An Optimal Acceptance Policy for an Urn Scheme.
SIAM J. Discret. Math., 1998

Attacks on Shamir's 'RSA for Paranoids'.
Inf. Process. Lett., 1998

The Size and Growth Rate of the Internet.
First Monday, 1998

Silicon Dreams and Silicon Bricks: The Continuing Evolution of Libraries.
Libr. Trends, 1997

The Economics of Electronic Journals.
First Monday, 1997

Fixed fee versus unit pricing for information goods: competition, equilibria, and price wars.
First Monday, 1997

Monotonic subsequences in dimensions higher than one.
Electron. J. Comb., 1997

An Efficient Micropayment System Based on Probabilistic Polling.
Proceedings of the Financial Cryptography, 1997

The slow evolution of electronic publishing.
Proceedings of the 1st ICCC/IFIP conference held at the University of Kent, 1997

Short Proofs for Nondivisibility of Sparse Polynomials under the Extended Riemann.
Fundam. Informaticae, 1996

Analytic methods in asymptotic enumeration.
Discret. Math., 1996

The bumpy road of Electronic Commerce.
Proceedings of WebNet 96, 1996

Computer Algebra and its Applications: Where are we Going?
Proceedings of the Beherrschung von Informationssystemen, 1996

Search for the Maximum of a Random Walk.
Random Struct. Algorithms, 1995

Tragic loss or good riddance? The impending demise of traditional scholarly journals.
Int. J. Hum. Comput. Stud., 1995

Nonabelian sets with distinct k-sums.
Discret. Math., 1995

Fast Parallel Solution of Fixed Point Equations for the Performance Evaluation of Circuit-Switched Networks.
Perform. Evaluation, 1994

Minimal-distance routing for KYKLOS II.
Networks, 1994

Tragic Loss or Good Riddance? The Impending Demise of Traditional Scholary Journals.
J. Univers. Comput. Sci., 1994

The Distribution of Heights of Binary Trees and Other Simple Trees.
Comb. Probab. Comput., 1993

Improved Low-Density Subset Sum Algorithms.
Comput. Complex., 1992

Existence of Short Proofs for Nondivisibility of Sparse Polynomials under the Extended Riemann Hypothesis.
Proceedings of the 1992 International Symposium on Symbolic and Algebraic Computation, 1992

The Eurocrypt '92 Controversial Issue: Trapdoor Primes and Moduli (Panel).
Proceedings of the Advances in Cryptology, 1992

Computation of Discrete Logarithms in Prime Fields.
Des. Codes Cryptogr., 1991

An Improved Low-Denisty Subset Sum Algorithm.
Proceedings of the Advances in Cryptology, 1991

Singularity Analysis of Generating Functions.
SIAM J. Discret. Math., 1990

On the number of alignments of <i>k</i> sequences.
Graphs Comb., 1990

Computation of Discrete Logarithms in Prime Fields (Extended Abstract).
Proceedings of the Advances in Cryptology, 1990

Solving Large Sparse Linear Systems over Finite Fields.
Proceedings of the Advances in Cryptology, 1990

Random Mapping Statistics.
Proceedings of the Advances in Cryptology, 1989

Simple, Efficient Asynchronous Parallel Algorithms for Maximization.
ACM Trans. Program. Lang. Syst., 1988

Balancing sets of vectors.
IEEE Trans. Inf. Theory, 1988

Cryptanalysis: a survey of recent results.
Proc. IEEE, 1988

On subspaces spanned by random selections of plus/minus 1 vectors.
J. Comb. Theory A, 1988

Decreasing Energy Functions and Lengths of Transients for Some Cellular Automata.
Complex Syst., 1988

Bandwidths and profiles of trees.
J. Comb. Theory B, 1987

Computing pi(x): An Analytic Method.
J. Algorithms, 1987

Ramsey-Sperner theory.
Discret. Math., 1987

On the Periods of Some Graph Transformations.
Complex Syst., 1987

Minimal-Distance Routing for Kykios II.
Proceedings of the International Conference on Parallel Processing, 1987

On the existence of optimum cyclic burst-correcting codes.
IEEE Trans. Inf. Theory, 1986

Constant Time Generation of Free Trees.
SIAM J. Comput., 1986

<i>k</i>-Color Sperner theorems.
J. Comb. Theory A, 1986

On the Capacity of Disjointly Shared Networks.
Comput. Networks, 1986

Discrete Logarithms in GF(p).
Algorithmica, 1986

Solving Low-Density Subset Sum Problems
J. ACM, January, 1985

On the Number of Distinct Block Sizes in Partitions of a Set.
J. Comb. Theory A, 1985

The Asymptotic Number of Irreducible Partitions.
Eur. J. Comb., 1985

Partitions of planar sets into small triangles.
Discret. Math., 1985

A Chosen Text Attack on the RSA Cryptosystem and Some Discrete Logarithm Schemes.
Proceedings of the Advances in Cryptology, 1985

Cryptanalytic attacks on the multiplicative knapsack cryptosystem and on Shamir's fast signature scheme.
IEEE Trans. Inf. Theory, 1984

Discrete Logarithms in Finite Fields and Their Cryptographic Significance.
Proceedings of the Advances in Cryptology: Proceedings of EUROCRYPT 84, 1984

Fast Cryptanalysis of the Matsumoto-Imai Public Key Scheme.
Proceedings of the Advances in Cryptology: Proceedings of EUROCRYPT 84, 1984

On the Density of Sequences of Integers the Sum of No Two of Which Is a Square II. General Sequences.
J. Comb. Theory A, 1983

On the Tightest Packing of Sums of Vectors.
Eur. J. Comb., 1983

On Subsets with Cardinalities of Intersections Divisible by a Fixed Integer.
Eur. J. Comb., 1983

On the average product of Gauss-Markov variables.
Bell Syst. Tech. J., 1983

Evaluation of the Adleman Attack on Multiply Iterated Knapsack Cryptosystems.
Proceedings of the Advances in Cryptology, 1983

On the Density of Sequences of Integers the Sum of No Two of which Is a Square. I. Arithmetic Progressions.
J. Comb. Theory A, 1982

The Average Height of Binary Trees and Other Simple Trees.
J. Comput. Syst. Sci., 1982

On the Unimodality of some Partition Polynomials.
Eur. J. Comb., 1982

String Overlaps, Pattern Matching, and Nontransitive Games.
J. Comb. Theory A, 1981

Periods in Strings.
J. Comb. Theory A, 1981

Irreducibility Testing and Factorization of Polynomials (Extended Abstract)
Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981

A New Proof of the Linearity of the Boyer-Moore String Searching Algorithm.
SIAM J. Comput., 1980

Exploring Binary Trees and Other Simple Trees
Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 1980

New Bounds on the Number of Unit Spheres That Can Touch a Unit Sphere in n Dimensions.
J. Comb. Theory A, 1979

Coefficient inaccuracy in FIR filters.
Proceedings of the IEEE International Conference on Acoustics, 1979

Bounds for binary codes of length less than 25.
IEEE Trans. Inf. Theory, 1978

Self-Dual Codes over GF(4).
J. Comb. Theory A, 1978

Pelikán's Conjecture Cyclotomic Cosets.
J. Comb. Theory A, 1977

An upper bound for self-dual codes (Corresp.).
IEEE Trans. Inf. Theory, 1975

A new theorem about the Mattson-Solomon polynomial, and some applications.
IEEE Trans. Inf. Theory, 1974

On covering a product of sets with products of their subsets.
Discret. Math., 1973