Maximal non- hamilton-laceable graphsGustavus J. Simmons · 1981

Parity Encoding of Binary SequencesGustavus J. Simmons · Designs, Codes and Cryptography · 2002

Subliminal channels; past and presentGustavus J. Simmons · 1994

Symmetric and Asymmetric EncryptionSimmons, Gustavus J. · ACM Computing Surveys · 1979

Cryptanalysis and protocol failuresSimmons, Gustavus J. · Communications of the ACM · 1994

10735Gustavus J. Simmons · The American Mathematical Monthly · 1999

Contemporary Cryptology || CryptographySimmons, Gustavus J. · 1999

The chromatic number of the sphereSimmons, Gustavus J. · Journal of the Australian Mathematical Society · 1976

Enumerating Boolean functions of cryptographic significanceChris Mitchell · Journal of Cryptology · 1990

PrefaceIvan Bjerre Damgård · Journal of Cryptology · 1992

Experimental quantum cryptographyCharles H. Bennett; François Bessette; Gilles Brassard; Louis Salvail; John Smolin · Journal of Cryptology · 1992

Efficient signature generation by smart cardsC. P. Schnorr · Journal of Cryptology · 1991

Guest editor's introductionJoan Feigenbaum · Journal of Cryptology · 1991

Local randomness in pseudorandom sequencesUeli M. Maurer; James L. Massey · Journal of Cryptology · 1991

Bit commitment using pseudorandomnessMoni Naor · Journal of Cryptology · 1991

Guest editors' introductionThomas A. Berson; Rainer A. Rueppel · Journal of Cryptology · 1991