Application of an associatively addressed, distributed memory. - Gustavus J. Simmons (AFIPS Spring Joint Computing Conference, 1964)

A constructive analysis of the aperiodic binary correlation function. - Gustavus J. Simmons (IEEE Trans. Inf. Theory, 1969)

An Extremal Problem in the Uniform Covering of Finite Sets. - Gustavus J. Simmons (J. Comb. Theory A, 1972)

Sums of Valences in Bigraphs. - Roger C. Entringer; Gustavus J. Simmons (J. Comb. Theory A, 1973)

On a problem of Erdös concerning a 3-coloring of the unit sphere. - Gustavus J. Simmons (Discret. Math., 1974)

Preliminary Comments on the M.I.T. Public-Key Cryptosystem. - Gustavus J. Simmons; Michael J. Norris (Cryptologia, 1977)

Symmetric and Asymmetric Encryption. - Gustavus J. Simmons (ACM Comput. Surv., 1979)

Secure Communications in the Presence of Pervasive Deceit. - Gustavus J. Simmons (S&P, 1980)

Software Protection Using "Communal Key Cryptosystems". - George B. Purdy; Gustavus J. Simmons; James Studier (CRYPTO, 1981)

A System for Point-of-Sale or Access User Authentication and Identification. - Gustavus J. Simmons (CRYPTO, 1981)

Half a Loaf is Better than None: Some Novel Message Integrity Problems. - Gustavus J. Simmons (S&P, 1981)

Maximal non- hamilton-laceable graphs. - Gustavus J. Simmons (J. Graph Theory, 1981)

A Preliminary Report on the Cryptanalysis of Merkle-Hellman Knapsack Cryptosystems. - Ernest F. Brickell; James A. Davis; Gustavus J. Simmons (CRYPTO, 1982)

A Software Protection Scheme. - George B. Purdy; Gustavus J. Simmons; James Studier (S&P, 1982)

Forward Search as a Cryptanalytic Tool Against a Public Key. - Gustavus J. Simmons; Diane B. Holdridge (S&P, 1982)

The Prisoners' Problem and the Subliminal Channel. - Gustavus J. Simmons (CRYPTO, 1983)

Verification of Treaty Compliance Revisited. - Gustavus J. Simmons (S&P, 1983)

A "Weak" Privacy Protocol using the RSA Crypto Algorithm. - Gustavus J. Simmons (Cryptologia, 1983)

Authentication Theory/Coding Theory. - Gustavus J. Simmons (CRYPTO, 1984)

Status Report on Factoring (At the Sandia National Laboratories). - James A. Davis; Diane B. Holdridge; Gustavus J. Simmons (EUROCRYPT, 1984)

The Subliminal Channel and Digital Signature. - Gustavus J. Simmons (EUROCRYPT, 1984)

A System for Verifying User Identity and Authorization at the Point-of Sale or Access. - Gustavus J. Simmons (Cryptologia, 1984)

A Secure Subliminal Channel (?). - Gustavus J. Simmons (CRYPTO, 1985)

The Practice of Authentication. - Gustavus J. Simmons (EUROCRYPT, 1985)

How to (Selectively) Broadcast A Secret. - Gustavus J. Simmons (S&P, 1985)

Cycle Structures of the DES with Weak and Semi-Weak Keys. - Judy H. Moore; Gustavus J. Simmons (CRYPTO, 1986)

Cycle Structure of the Weak and Semi-Weak DES Keys. - Judy H. Moore; Gustavus J. Simmons (EUROCRYPT, 1986)

An Impersonation-Proof Identity Verfication Scheme. - Gustavus J. Simmons (CRYPTO, 1987)

A Natural Taxonomy for Digital Information Authentication Schemes. - Gustavus J. Simmons (CRYPTO, 1987)

Message Authentication with Arbitration of Transmitter/Receiver Disputes. - Gustavus J. Simmons (EUROCRYPT, 1987)

Cycle Structure of the DES for Keys Having Palindromic (or Antipalindromic) Sequences of Round Keys. - Judy H. Moore; Gustavus J. Simmons (IEEE Trans. Software Eng., 1987)

How to (Really) Share a Secret. - Gustavus J. Simmons (CRYPTO, 1988)

Zero-Knowledge Proofs of Identity And Veracity of Transaction Receipts. - Gustavus J. Simmons; George B. Purdy (EUROCRYPT, 1988)

A survey of information authentication. - Gustavus J. Simmons (Proc. IEEE, 1988)

How to insure that data acquired to verify treaty compliance are trustworthy. - Gustavus J. Simmons (Proc. IEEE, 1988)

Prepositioned Shared Secret and/or Shared Control Schemes. - Gustavus J. Simmons (EUROCRYPT, 1989)

A protocol to provide verifiable proof of identity and unforgeable transaction receipts. - Gustavus J. Simmons (IEEE J. Sel. Areas Commun., 1989)

Geometric Shared Secret and/or Shared Control Schemes. - Gustavus J. Simmons (CRYPTO, 1990)

A Protocol to Set Up Shared Secret Schemes Without the Assistance of a Mutualy Trusted Party. - Ingemar Ingemarsson; Gustavus J. Simmons (EUROCRYPT, 1990)

A Cartesian Product Construction for Unconditionally Secure Authentication Codes that Permit Arbitration. - Gustavus J. Simmons (J. Cryptol., 1990)

Public-Key Cryptography: State of the Art and Future Directions, E.I.S.S. Workshop, Oberwolfach, Germany, July 3-6, 1991, Final Report - Thomas Beth; Markus Frisch; Gustavus J. Simmons (Springer, 1992)

Cryptanalysis and Protocol Failures (abstract). - Gustavus J. Simmons (CCS, 1993)

Invited talk: An Introductions to the Mathematics of Trust in Security Protocols. - Gustavus J. Simmons (CSFW, 1993)

Subliminal Communication is Easy Using the DSA. - Gustavus J. Simmons (EUROCRYPT, 1993)

The Consequences of Trust in Shared Secret Schemes. - Gustavus J. Simmons (EUROCRYPT, 1993)

Towards Acceptable Key Escrow Systems. - Thomas Beth; Hans-Joachim Knobloch; Marcus Otten; Gustavus J. Simmons; Peer Wichmann (CCS, 1994)

Cryptanalysis and Protocol Failures. - Gustavus J. Simmons (Commun. ACM, 1994)

Subliminal channels; past and present. - Gustavus J. Simmons (Eur. Trans. Telecommun., 1994)

Proof of Soundness (Integrity) of Cryptographic Protocols. - Gustavus J. Simmons (J. Cryptol., 1994)

The Role of Trust in Information Integrity Protocols. - Gustavus J. Simmons; Catherine Meadows 001 (J. Comput. Secur., 1995)

The history of subliminal channels. - Gustavus J. Simmons (IEEE J. Sel. Areas Commun., 1998)

Results concerning the bandwidth of subliminal channels. - Gustavus J. Simmons (IEEE J. Sel. Areas Commun., 1998)

A Congruence for Pascal Triangular Matrices: 10735. - Gustavus J. Simmons; John Henry Steelman; O. P. Lossers; et al. (Am. Math. Mon., 2001)

Parity Encoding of Binary Sequences. - Gustavus J. Simmons (Des. Codes Cryptogr., 2002)

A surprising regularity in the number of Hamilton paths in polygonal bigraphs. - Gustavus J. Simmons (Ars Comb., 2014)

Cubic, edge critical, Hamilton laceable bigraphs. - Gustavus J. Simmons (Ars Comb., 2015)

On Edge Extremal Properties of Hamilton laceable bigraphs. - Gustavus J. Simmons (Bull. ICA, 2017)

Two related (?) 2-edge-Hamiltonian bigraph conjectures. - Gustavus J. Simmons (Bull. ICA, 2020)

Two related (?) 2-edge-Hamiltonian bigraph conjectures addendum. - Gustavus J. Simmons (Bull. ICA, 2020)