Gustavus Simmons | Academic Influence

Gustavus Simmons's AcademicInfluence.com Rankings

Gustavus Simmons

Computer Science

#2606

World Rank

#2726

Historical Rank

#1124

USA Rank

Network Security

#12

World Rank

#12

Historical Rank

#4

USA Rank

Database

#3749

World Rank

#3903

Historical Rank

#653

USA Rank

computer-science Degrees

Gustavus Simmons

Engineering

#3253

World Rank

#4298

Historical Rank

#960

USA Rank

Electrical Engineering

#1111

World Rank

#1194

Historical Rank

#229

USA Rank

engineering Degrees

Download Badge

Computer Science
Engineering

Gustavus Simmons's Degrees

Masters Mathematics Stanford University
Bachelors Electrical Engineering University of California, Berkeley

Why Is Gustavus Simmons Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Gustavus J. Simmons is a retired cryptographer and former manager of the applied mathematics Department and Senior Fellow at Sandia National Laboratories. He worked primarily with authentication theory, developing cryptographic techniques for solving problems of mutual distrust and in devising protocols whose function could be trusted, even though some of the inputs or participants cannot be. Simmons was born in West Virginia and was named after his grandfather, a prohibition officer who was gunned down three years before Gustavus was born. He began his post-secondary education at Deep Springs College, and received his Ph.D in mathematics from the University of New Mexico, Albuquerque.

(See a Problem?)

Gustavus Simmons's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

The Prisoners' Problem and the Subliminal Channel (1983) (1113)
Contemporary Cryptology: The Science of Information Integrity (1994) (637)
Authentication Theory/Coding Theory (1985) (371)
A survey of information authentication (1988) (239)
Symmetric and Asymmetric Encryption (1979) (190)
Subliminal Communication is Easy Using the DSA (1994) (113)
A Protocol to Set Up Shared Secret Schemes Without the Assistance of a Mutualy Trusted Party (1991) (112)
The history of subliminal channels (1996) (102)
Message Authentication with Arbitration of Transmitter/Receiver Disputes (1987) (89)
Measurement of relative oscillator strengths for Fe I: transitions from levels ${b}^{3}\,{F}_{2-4}$ (2.61 eV – 2.56 eV). Use of a multipass optical system (1982) (83)
An Introduction to Shared Secret and/or Shared Control Schemes and Their ApplicationThis work was performed at Sandia National Laboratories and supported by the U.S. Department of Energy under contract number DEAC0476DPOO789. (1992) (82)
Subliminal channels; past and present (2010) (81)
Precision measurement of relative oscillator strengths – IX. Measures of Fe I transitions from levels $a^{5} P_{1-3} (2.18-2.28 \,\text{eV}), \,a^{3} \,P_{2} \,(2.28 \,\text{eV}), a{3}\,P_{0,1} \,(2.49-2.42 \,\text{eV}), z^{7}\, D_{1-5}^{0}\, (2.48-2.40 \,\text{eV}) \,\text{and} \,a^{3} \,H_{4-6} \, (1982) (79)
The Subliminal Channel and Digital Signature (1985) (78)
A "Weak" Privacy Protocol using the RSA Crypto Algorithm (1983) (68)
Cryptanalysis and protocol failures (1994) (65)
The Smart Card: A Standardized Security Device Dedicated to Public Cryptology (1992) (63)
Preliminary Comments on the M.I.T. Public-Key Cryptosystem (1977) (57)
Prepositioned Shared Secret and/or Shared Control Schemes (1990) (51)
Public-Key Cryptography: State of the Art and Future Directions (1992) (51)
A cartesian product construction for unconditionally secure authentication codes that permit arbitration (1990) (49)
A Secure Subliminal Channel (?) (1985) (46)
How to (Selectively) Broadcast A Secret (1985) (45)
Results concerning the bandwidth of subliminal channels (1998) (44)
How to insure that data acquired to verify treaty compliance are trustworthy (1988) (41)
Cycle Structures of the DES with Weak and Semi-Weak Keys (1986) (38)
The Role of Trust in Information Integrity Protocols (1995) (37)
Cycle Structure of the DES for Keys Having Palindromic (or Antipalindromic) Sequences of Round Keys (1987) (37)
Note on the interpretation of Fe I lines (2.18–2.49 eV) in the solar spectrum (1982) (29)
Verification of Treaty Compliance -- Revisited (1983) (28)
An introduction to the mathematics of trust in security protocols (1993) (26)
Geometric Shared Secret and/or Shared Control Schemes (1990) (26)
The chromatic number of the sphere (1976) (24)
A System for Verifying User Identity and Authorization at the Point-of Sale or Access (1984) (24)
Cryptology: The Mathematics of Secure Communication (1979) (23)
Forward Search as a Cryptanalytic Tool Against a Public Key (1982) (22)
A Software Protection Scheme (1982) (21)
A Natural Taxonomy for Digital Information Authentication Schemes (1987) (21)
Status Report on Factoring (At the Sandia National Laboratories) (1984) (20)
On a problem of Erdös concerning a 3-coloring of the unit sphere (1974) (16)
Zero-Knowledge Proofs of Identity And Veracity of Transaction Receipts (1988) (16)
An Impersonation-Proof Identity Verfication Scheme (1987) (15)
The First Ten Years of Public Key Cryptology (1992) (14)
Secure Communications And Asymmetric Cryptosystems (1984) (13)
The Practice of Authentication (1985) (13)
Cryptanalysis: A Survey of Recent Results (1992) (13)
Towards acceptable key escrow systems (1994) (12)
Analysis of Fe I lines /chi between 0.00 eV. and 2.6 eV/ in the solar spectrum using improved damping constants and accurate oscillator strengths - Test of a solar model atmosphere (1982) (12)
Status report on factoring (at the Sandia National Labs) (1985) (12)
Overview of Interactive Proof Systems and ZeroKnowledge (1992) (11)
An Extremal Problem in the Uniform Covering of Finite Sets (1972) (10)
Oscillator strengths of Fe II lines derived from the solar spectrum - Choice of solar model atmosphere (1980) (10)
A maximal 2-arrangement of sixteen lines in the projective plane (1973) (10)
Surface penetrators - a promising new type of planetary lander. (1977) (8)
Interpretation of Ti I lines of excitation energy 0.0–0.05 eV in the solar spectrum; use of new oscillator strengths of accuracy 0.5 per cent (1982) (8)
A Preliminary Report on the Cryptanalysis of Merkle-Hellman Knapsack Cryptosystems (1982) (7)
A protocol to provide verifiable proof of identity and unforgeable transaction receipts (1989) (7)
Application of an associatively addressed, distributed memory (1964) (7)
A theoretical study of errors in radio interferometer type measurements attributable to inhomogeneities of the medium (1957) (6)
A quadrilateral-free arrangement of sixteen lines (1972) (6)
The Consequences of Trust in Shared Secret Schemes (1994) (6)
A two-coloring inequality for Euclidean two-arrangements (1979) (6)
Public-Key Cryptography State (1992) (6)
Precision measurement of relative oscillator strengths - IX. Measures of Fe I transitions from levels Formula (1982) (5)
Maximal non- hamilton-laceable graphs (1981) (5)
Public-Key Cryptography: State of the Art and Future Directions: E.I.S.S. Workshop, Oberwolfach, Germany, July 3-6, 1991. Final Report (1992) (4)
How many 3-term arithmetic progressions can there be if there are no longer ones (1977) (4)
A System for Point-of-Sale or Access User Authentication and Identification (1981) (4)
Secure Communications in the Presence of Pervasive Deceit (1980) (4)
A MATHEMATICAL MODEL FOR AN ASSOCIATIVE MEMORY (1963) (3)
Cycle Structure of the Weak and Semi-Weak DES Keys (1986) (3)
Some properties of components of bigraphs (1973) (3)
The Number of Irreducible Polynomials of Degree n Over GF ( p) (1970) (3)
Correlation Properties of Pseudo-Rademacher-Walsh Codes (1971) (2)
The Number of Irreducible Polynomials of Degree n Over Gf(p) (1970) (2)
Shorter Notes: A Quadrilateral-Free Arrangement of Sixteen Lines (1972) (2)
Parity Encoding of Binary Sequences (2002) (2)
Proof of soundness (integrity) of cryptographic protocols (1994) (2)
Public Key Cryptography (1992) (2)
Cryptanalysis and protocol failures (abstract) (1993) (2)
Scope of the workshop (1992) (1)
Cubic, edge critical, Hamilton laceable bigraphs (2015) (1)
Comments concerning the Kallmann-White-Newell article, “Physical properties of the atmosphere from 90 to 300 kilometers” (1957) (1)
Sums of valences in bigraphs. II (1973) (1)
Two related (?) 2-edge-Hamiltonian bigraph conjectures (2020) (1)
Software Protection Using "Communal Key Cryptosystems" (1981) (1)
A constructive analysis of the aperiodic binary correlation function (1969) (1)
Editor’s biography (2019) (1)
Some Results Concerning the Occurrence of Specified Prime Factors in \binommr (1970) (1)
A Survey of Information AuthenticationThis work was performed at Sandia National Laboratories and supported by the u.s. Department of Energy under contract no. DEAC0476DP00789. (1992) (1)
An application of maximum-minimum distance circuits on hypercubes (1978) (0)
HOW TO (REALLY) SHARE A 8ECRZT1 (1990) (0)
A Comparison of Practical Public Key Cryptosystems Based on Integer Factorization and Discrete LogarithmsPartial support for this work was provided by the University of Waterloo, Waterloo, Ontario, and by Newbridge Microsystems (a division of Newbridge Networks Corporation), Kanata, Ontario. (1992) (0)
Short classification and description of the most prominent public-key systems (1992) (0)
A Combinational Analysis of Finite Minimal Uniform Covers (1969) (0)
EXTENSION OF THE APPLICATION OF REPRODUCING KERNELS TO A SAMPLING THEOREM FOR ADAPTIVE SYSTEMS. (1967) (0)
AN ALGORITHM FOR THE CALCULATION OF A CLASS OF FIXED POINTS FOR SERIAL LINEAR SYSTEMS (1964) (0)
An appraisal of photon counter measurements of upper atmosphere parameters (1957) (0)
Generalized Petersen graphs G(n,4) are Hamiltonian for All n not equal to 8/sup +/ (1979) (0)
Some Results Pertaining to Fermat's Conjecture (1966) (0)
Two related (?) 2-edge-Hamiltonian bigraph conjectures addendum (2020) (0)
On Edge Extremal Properties of Hamilton laceable bigraphs (2017) (0)
A Study of the Error Involved in the Near Use of a Radio Interferometer (1959) (0)
A surprising regularity in the number of Hamilton paths in polygonal bigraphs (2014) (0)
Public-key cryptography depending on computational number theory (1992) (0)
Asymptotically Optimum Re-Emphasis and De-Emphasis Networks for Sampling and Quantizing (1966) (0)
A Congruence for Pascal Triangular Matrices: 10735 (2001) (0)
The Puzzling Science of Information Integrity (1995) (0)
System Security (Dagstuhl Seminar 9214) (2021) (0)
A generalized converse to a lemma of L. Lovász (1973) (0)
CycleStructure oftheDES forKeysHaving Palindromic(orAntipalindromic) Sequences of Round Keys (1987) (0)
A Combinatorial Problem Associated with a Family of Combination Locks (1964) (0)
An RSA-Related Number-Theoretic Surprise (2004) (0)
Projection of needs and requirements for public-key systems (1992) (0)
Public-key systems: Mistakes and problems (1992) (0)
Half a Loaf is Better than None: Some Novel Message Integrity Problems (1981) (0)
Invited talk: An Introductions to the Mathematics of Trust in Security Protocols. (1993) (0)
Viking Lander: subsurface water analyzing probe. [Mars subsoil] (1969) (0)
List of topics chosen through self-assessment (1992) (0)
ALGEBRAIC THEORY OF THE TWO-SIDED CORRELATION FUNCTION FOR BINARY CODES. (1967) (0)

This paper list is powered by the following services:

Other Resources About Gustavus Simmons

en.wikipedia.org

What Schools Are Affiliated With Gustavus Simmons?

Gustavus Simmons is affiliated with the following schools:

Image Attributions

Image Source for Gustavus Simmons