A test for randomness based on a complexity measure

Martínez-Morales, Manuel; Duran, Benjamin S.

doi:10.1080/03610929308831062

Cited by 2 publications

(1 citation statement)

References 20 publications

(25 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The Berlekamp's algorithm will find the shortest linear recurrence, with the coefficients form a given field, which generates the sequence. Using the notion of equivalent linear complexity we can design statisticalalgorithmic tests (see [26], [33] and [34]) which allows us to crack some classes of LFSR(1inear feedback shift register). Some examples of cracking methods are presented in the last paragraph of this paper.…”

Section: X-iomentioning

confidence: 99%

Complexity computations in code cracking problems

Simion¹,

Constantinescu²

24th International Spring Seminar on Electronics Technology. Concurrent Engineering in Electronic Packaging. ISSE 2001. Confere

View full text Add to dashboard Cite

Linear complexity of a sequence is the size of the shortest feedback shifi register, which generates the sequence. A method of estimating this complexity consists in successive processing of the sequence and obtaining a monotone increasing sequence of estimators (linear complexity profile) which limit is the linear complexity. The presented results have applications in cryptography, more exactly, they can be used tofind the linear equivalent complexity of a cipher algorithm and thus to estimate the cryptographic resistance. In this paper we present some eficient methods of estimating and evaluation the linear equivalent complexity of a cipher algorithm. There are presented some interesting and new results concerning the complexity of the combinations of linear feedback shift registers. These combinations can be described in terms of boolean function theory using the logical operators like sum and product. There are also introduced the notion of spliting (a generalization of classical term of decimation) and the inverse operator called interleave. The proofs of the theorems are also given. This work can be easy generalized to quadratic complexity of high order complexity.

show abstract

Section: X-iomentioning

confidence: 99%

Complexity computations in code cracking problems

Simion¹,

Constantinescu²

24th International Spring Seminar on Electronics Technology. Concurrent Engineering in Electronic Packaging. ISSE 2001. Confere

View full text Add to dashboard Cite

show abstract

Citation analysis of the Texas Tech University’s statistics faculty : a study applied to collection development at the University Library

Johnson¹

1996

LIBRES

View full text Add to dashboard Cite

Texas Tech University is a part of the Texas State University System which opened its doors in 1925. The current enrollment is about 24,000 dispersed among six colleges. The Mathematics Department is one of thirteen in the College of Arts and Sciences with a Ph.D. program. One of those programs is in statistics. Seven faculty members were identified from that program. Their contribution to published research for 1993 and the first half of 1994 was collected and a citation analysis was conducted and subsequently applied to the collection development process at the University Library, where distinct discipline based collection development policies are now being formulated. Two citation patterns were identified: bibliographic and non-bibliographic citations. Bibliographic citations (from the bibliography) numbered 394 from 122 titles. Journals and monographs were the two formats most frequently cited, 46.7% and 36.9%, respectively. The average age of a citation was 12.3 years. The two most frequently cited journal titles were: Journal of Time Series Analysis and Stochastic Processes and Their Applications. Non-bibliographic citations (not found in the bibliography) were used to identify the more important research topics to this population of faculty: Hermitian operators, Appel polynomials, Laplace transform, Euclidean space, Drichlet polynomials, Lebesgue measure, Hilbert space, and Taylor expansion. Since the conclusion of this study, the most frequently cited journals and monographs have been acquired or recommended for acquisition in conjunction with the Library's collection development policy for Mathematics. Go to Appendix OneGo to Appendix Two _______________________________________ This document may be circulated freely with the following statement included in its entirety:

show abstract

A test for randomness based on a complexity measure

Cited by 2 publications

References 20 publications

Complexity computations in code cracking problems

Complexity computations in code cracking problems

Citation analysis of the Texas Tech University’s statistics faculty : a study applied to collection development at the University Library

Contact Info

Product

Resources

About