Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Gregory L. Mayhew

dblp:02/6954 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1994
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 1 · 1 first-authorTheory of computation · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Cryptographic primitives and cryptanalysis · 100%
Theoretical computer science
1 paper
Coding theory · 100%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › stream cipher
keystream generator
0.011994
A low cost, high speed encryption system and method · S&P 1994
Cryptographic primitives and cryptanalysis
stream cipher
0.011994
A low cost, high speed encryption system and method · S&P 1994
Coding theory › sequences
linear complexity
0.011990
Linear spans of modified de Bruijn sequences · IEEE Trans. Inf. Theory 1990
Cryptographic primitives and cryptanalysis › random number generation
randomness testing
0.011994
A low cost, high speed encryption system and method · S&P 1994
Coding theory › sequences
de bruijn sequences
0.011990
Linear spans of modified de Bruijn sequences · IEEE Trans. Inf. Theory 1990

Methods — techniques the papers use, named apart from their topics

shift register · 0.0de bruijn function · 0.0
YearPublicationVenuePosition
1994 A low cost, high speed encryption system and method
abstract
Multiple independent binary bit streams per clock cycle are produced from a single underlying shift register based keystream generator with multiple combining circuits. Logic designs are derived from de Bruijn functions. Multiplicity of keystream facilitates using just a single cryptographic device to support high speed, large quantity data transfers over networks. Low cost implementations are also possible since the underlying algorithm operates at some fraction of the network data rate. Empirical tests indicate the keystream satisfies many statistical randomness metrics. >
Gregory L. Mayhew
S&P1
1990 Linear spans of modified de Bruijn sequences
abstract
Order n modified de Bruijn sequences are created by removing a single zero from the longest run of zeros in period 2/sup n/ de Bruijn sequences. The M sequences are then the natural undisguised linear subset of modified de Bruijn sequences. Theorems are given on the linear spans of modified de Bruijn sequences and data are presented for 4>
Gregory L. Mayhew, Solomon W. Golomb
IEEE Trans. Inf. Theory1