Gustavus J. Simmons - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 57 from 57

2020

Two related (?) \(2\)-edge-Hamiltonian bigraph conjecturesGustavus J. Simmons. bullica, 88:98-117, 2020. [doi]

Two related (?) 2-edge-Hamiltonian bigraph conjectures addendumGustavus J. Simmons. bullica, 89:102-103, 2020. [doi]

2017

On Edge Extremal Properties of Hamilton laceable bigraphsGustavus J. Simmons. bullica, 80:21-39, 2017. [doi]

2015

Cubic, edge critical, Hamilton laceable bigraphsGustavus J. Simmons. arscom, 123:291-302, 2015.

2014

A surprising regularity in the number of Hamilton paths in polygonal bigraphsGustavus J. Simmons. arscom, 115:335-341, 2014.

2002

Parity Encoding of Binary SequencesGustavus J. Simmons. dcc, 27(1-2):157-164, 2002.

2001

A Congruence for Pascal Triangular Matrices: 10735Gustavus J. Simmons, John Henry Steelman, O. P. Lossers, et al.. tamm, 108(4):373-374, 2001. [doi]

1998

The history of subliminal channelsGustavus J. Simmons. jsac, 16(4):452-462, 1998. [doi]

Results concerning the bandwidth of subliminal channelsGustavus J. Simmons. jsac, 16(4):463-473, 1998. [doi]

1996

The History of Subliminal ChannelsGustavus J. Simmons. ih 1996: 237-256

1995

The Role of Trust in Information Integrity ProtocolsGustavus J. Simmons, Catherine Meadows. jcs, 3(1):71-84, 1995.

1994

Towards Acceptable Key Escrow SystemsThomas Beth, Hans-Joachim Knobloch, Marcus Otten, Gustavus J. Simmons, Peer Wichmann. ccs 1994: 51-58 [doi]

Proof of Soundness (Integrity) of Cryptographic ProtocolsGustavus J. Simmons. joc, 7(2):69-77, 1994.

Cryptoanalysis and Protocol FailuresGustavus J. Simmons. CACM, 37(11):56-65, 1994.

Subliminal channels; past and presentGustavus J. Simmons. ett, 5(4):459-474, 1994. [doi]

1993

The Consequences of Trust in Shared Secret SchemesGustavus J. Simmons. eurocrypt 1993: 448-452 [doi]

Subliminal Communication is Easy Using the DSAGustavus J. Simmons. eurocrypt 1993: 218-232 [doi]

Invited talk: An Introductions to the Mathematics of Trust in Security ProtocolsGustavus J. Simmons. csfw 1993: 121-127

Cryptanalysis and Protocol Failures (abstract)Gustavus J. Simmons. ccs 1993: 213-214 [doi]

1990

A Protocol to Set Up Shared Secret Schemes Without the Assistance of a Mutualy Trusted PartyIngemar Ingemarsson, Gustavus J. Simmons. eurocrypt 1990: 266-282 [doi]

A Cartesian Product Construction for Unconditionally Secure Authentication Codes that Permit ArbitrationGustavus J. Simmons. joc, 2(2):77-104, 1990.

Geometric Shared Secret and/or Shared Control SchemesGustavus J. Simmons. crypto 1991: 216-241 [doi]

1989

Prepositioned Shared Secret and/or Shared Control SchemesGustavus J. Simmons. eurocrypt 1989: 436-467 [doi]

A protocol to provide verifiable proof of identity and unforgeable transaction receiptsGustavus J. Simmons. jsac, 7(4):435-447, 1989. [doi]

1988

Zero-Knowledge Proofs of Identity And Veracity of Transaction ReceiptsGustavus J. Simmons, George B. Purdy. eurocrypt 1988: 35-49 [doi]

How to (Really) Share a SecretGustavus J. Simmons. crypto 1990: 390-448 [doi]

How to insure that data acquired to verify treaty compliance are trustworthyGustavus J. Simmons. pieee, 76(5):621-627, 1988. [doi]

A survey of information authenticationGustavus J. Simmons. pieee, 76(5):603-620, 1988. [doi]

1987

Cycle Structure of the DES for Keys Having Palindromic (or Antipalindromic) Sequences of Round KeysJudy H. Moore, Gustavus J. Simmons. TSE, 13(2):262-273, 1987.

A Natural Taxonomy for Digital Information Authentication SchemesGustavus J. Simmons. crypto 1988: 269-288 [doi]

An Impersonation-Proof Identity Verfication SchemeGustavus J. Simmons. crypto 1988: 211-215 [doi]

Message Authentication with Arbitration of Transmitter/Receiver DisputesGustavus J. Simmons. eurocrypt 1987: 151-165 [doi]

1986

Cycle Structures of the DES with Weak and Semi-Weak KeysJudy H. Moore, Gustavus J. Simmons. crypto 1987: 9-32 [doi]

Cycle Structure of the Weak and Semi-Weak DES KeysJudy H. Moore, Gustavus J. Simmons. eurocrypt 1986: 16

1985

A Secure Subliminal Channel (?)Gustavus J. Simmons. crypto 1986: 33-41 [doi]

The Practice of AuthenticationGustavus J. Simmons. eurocrypt 1985: 261-272 [doi]

How to (Selectively) Broadcast A SecretGustavus J. Simmons. sp 1985: 108-115 [doi]

1984

Status Report on Factoring (At the Sandia National Laboratories)James A. Davis, Diane B. Holdridge, Gustavus J. Simmons. eurocrypt 1984: 183-215 [doi]

The Subliminal Channel and Digital SignatureGustavus J. Simmons. eurocrypt 1984: 364-378 [doi]

Authentication Theory/Coding TheoryGustavus J. Simmons. crypto 1985: 411-431 [doi]

A System for Verifying User Identity and Authorization at the Point-of Sale or AccessGustavus J. Simmons. cryptologia, 8(1):1-21, 1984. [doi]

1983

Verification of Treaty Compliance RevisitedGustavus J. Simmons. sp 1983: 61-66

The Prisoners Problem and the Subliminal ChannelGustavus J. Simmons. crypto 1983: 51-67

A "Weak" Privacy Protocol using the RSA Crypto AlgorithmGustavus J. Simmons. cryptologia, 7(2):180-182, 1983. [doi]

1982

A Preliminary Report on the Cryptanalysis of Merkle-Hellman Knapsack CryptosystemsErnest F. Brickell, James A. Davis, Gustavus J. Simmons. crypto 1982: 289-301

A Software Protection SchemeGeorge B. Purdy, Gustavus J. Simmons, James Studier. sp 1982: 99-103 [doi]

Forward Search as a Cryptanalytic Tool Against a Public KeyGustavus J. Simmons, Diane B. Holdridge. sp 1982: 117-128 [doi]

1981

Software Protection Using Communal Key Cryptosystems George B. Purdy, Gustavus J. Simmons, James Studier. crypto 1981: 79

A System for Point-of-Sale or Access User Authentication and IdentificationGustavus J. Simmons. crypto 1981: 31-37

Maximal non- hamilton-laceable graphsGustavus J. Simmons. jgt, 5(4):407-415, 1981. [doi]

Half a Loaf is Better than None: Some Novel Message Integrity ProblemsGustavus J. Simmons. sp 1981: 65-69 [doi]

1980

Secure Communications in the Presence of Pervasive DeceitGustavus J. Simmons. sp 1980: 84-93

1979

Symmetric and Asymmetric EncryptionGustavus J. Simmons. ACM Comput. Surv., 11(4):305-330, 1979.

1977

Preliminary Comments on the M.I.T. Public-Key CryptosystemGustavus J. Simmons, Michael J. Norris. cryptologia, 1(4):406-414, 1977. [doi]

1972

An Extremal Problem in the Uniform Covering of Finite SetsGustavus J. Simmons. JCT, 13(2):183-197, 1972.

1969

A constructive analysis of the aperiodic binary correlation functionGustavus J. Simmons. TIT, 15(3):340-345, 1969. [doi]

1964

Application of an associatively addressed, distributed memoryGustavus J. Simmons. afips 1964: 493-513 [doi]

Sign in or sign up to see more results.

runs on WebDSL