A generalized linear complexity

A generalized linear complexity (1992)

Cached

Download Links

[etd.lib.ttu.edu]

by Mark Steven Stamp

BibTeX

@MISC{Stamp92ageneralized,
    author = {Mark Steven Stamp},
    title = {A generalized linear complexity},
    year = {1992}
}

Bookmark

OpenURL

Abstract

Citations

8882	Computers and Intractability: A Guide to the Theory of NP-completeness - Garey, Johnson - 1979
2292	New Directions in Cryptography - Diffie, Hellman - 1976
1813	The Art of Computer Programming - Knuth - 1968
476	Concrete Mathematics - Graham, Knuth, et al. - 1989
351	Algebraic Coding Theory - Berlekamp - 1968
55	M.: Exhaustive cryptanalysis of the NBS data encryption standard - Diffie, Hellman - 1977
51	Graph Theory with Applications to Engineering and - Deo - 2002
41	Matrix interpretations and applications of the continued fraction algorithm, in - Gragg - 1972
29	Normal recurring decimals - Good - 1946
27	On the complexities of De Bruijn sequences - Chan, Games, et al. - 1982
18	de Bruijn, “A Combinatorial Problem,” Koninklijke Netherlands - G - 1946
13	The Codebreakers: the Story of Secret - Kahn - 1967
9	A simple derivation of the Berlekamp-Massey algorithm and some applications - Imamura, Yoshida - 1987
6	On the continued fraction and Berlekamp’s algorithm - Cheng - 1984
3	De Bruijn. Acknowledgement of priority to C. Flye Sainte-Marie on the counting of circular arrangements of 2n zeros and ones that show each nletter word exactly once - G - 1975
3	Elementary Number theory, Second edition, Wm.C.Brown - Burton - 1980
3	Analysis of the Berlekamp-Massey linear feedback shiftregister synthesis Edgorithm - Gustavson - 1976
2	How to generate cryptographically strong pseudorandom sequences - Blum, Micali - 1984
1	de Bniijn, "Circuits and trees in oriented Hneax graphs - Aaxdenne-Ehrenfest, G - 1951
1	Tilborg, "On the inherent intractabihty of certain coding problems - Berlekamp, McEHece, et al. - 1978
1	AuEdysis of a nonHneEo- feedforwaxd logic for binary sequence generators - Bernasconi, Giinther - 1986
1	On the quadratic spEm of de Bruijn sequences - Chan, Games - 1990
1	Security without identification: TrEmsEwrtion systems to msike big brother obsolete - Chaum - 1985
1	Continued fi*actions and the BerlekEmip-Massey Edgorithm - Zeng - 1990
1	LineEu: feedback shift registers Emd streEim ciphers - Dawson - 1990
1	Algorithms for the generation of fuU-length shiftregister sequences - Etzion, Lempel - 1984
1	The Great - Falls - 1959
1	A survey of fuU length nonHnear shift register cycle algorithms - Fredricksen - 1982
1	A fast Edgorithm for determining the complexity of a pseudo-random sequence with period 2 - Games, Chsm - 1983
1	Shift Register Sequences, AegeEm PEirk - Golomb - 1982
1	Generation of binary sequences with controUable complexity - Groth - 1971
1	The number of cross-join pEurs in mEiximum length linear sequences - Helleseth, Kl0ve - 1991
1	An EmEdysis of the structure Emd complexity of nonlineEu: biuEury sequence generators - Key - 1976
1	Computer encryption Emd the NationEd Security Agency connection - Kolata - 1977
1	On a homomorphism of the de Bruijn graph Emd its applications to the design of feedback shift registers - Lempel - 1970
1	Cycles of n-digit binso-y numbers - Lessard - 1951
1	Some mathematical aspects of recent Ewlvances in cryptology - Lidl