The DOI matches its Crossref record.
Shift Register Sequences: Secure and Limited-Access Code Generators, Efficiency Code Generators, Prescribed Property Generators, Mathematical Models
Abstract
From the Publisher: Shift register sequences are used in a broad range of applications, particularly in random number generation, multiple access and polling techniques, secure and privacy communication systems, error detecting and correcting codes, and synchronization pattern generation, as well as in modern cryptographic systems. The first edition of Shift Register Sequences, published in 1967, has been for many years the definitive work on this subject. In the revised edition, Dr. Golomb has added valuable supplemental material. The Revised Edition contains a comprehensive bibliography of some 400 entries which cover the literature concerning the theory and applications of shift register sequences. Written in a clear and lucid style, Dr. Golomb's approach is completely mathematical with rigorous proofs of all assertions. The proofs, however, may be omitted without loss of continuity by the reader who is interested only in results. Dr. Golomb is considered one of the foremost experts in the world with respect to combinatorial and geometrical aspects of coded communications.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Introduction to Finite Fields and their Applications
Lidl, R., & Niederreiter, H. (1994) · Cambridge University Press eBooks · doi:10.1017/cbo9781139172769 · Cited by 2,069
Sturm, C., & Wiesbeck, W. (2011) · Proceedings of the IEEE · doi:10.1109/jproc.2011.2131110 · Cited by 1,459
Theory of Spread-Spectrum Communications - A Tutorial
Pickholtz, R., Schilling, D., & Milstein, L. (1982) · IEEE Transactions on Communications · doi:10.1109/tcom.1982.1095533 · Cited by 1,370
OFDM and MC‐CDMA for Broadband Multi‐User Communications, WLANs and Broadcasting
Hanzo, L., Münster, M., Choi, B. J., & Keller, T. (2003) · Wiley eBooks · doi:10.1002/9780470861813 · Cited by 1,095
A Simple Unpredictable Pseudo-Random Number Generator
Blum, L., Blum, M., & Shub, M. (1986) · SIAM Journal on Computing · doi:10.1137/0215025 · Cited by 1,036
The field topography of ERG components in man—I. The photopic luminance response
Sutter, E. E., & Tran, D. (1992) · Vision Research · doi:10.1016/0042-6989(92)90235-b · Cited by 946
Boolean Functions for Cryptography and Error-Correcting Codes
Carlet, C. (2010) · Boolean Models and Methods in Mathematics, Computer Science, and Engineering · doi:10.1017/cbo9780511780448.011 · Cited by 847
Gaines, B. R. (1969) · Advances in Information Systems Science · doi:10.1007/978-1-4899-5841-9_2 · Cited by 745
Spreading codes for direct sequence CDMA and wideband CDMA cellular networks
Dinan, E. H., & Jabbari, B. (1998) · IEEE Communications Magazine · doi:10.1109/35.714616 · Cited by 591
Special Feature Exhaustive Cryptanalysis of the NBS Data Encryption Standard
Diffie, W., & Hellman, M. E. (1977) · Computer · doi:10.1109/c-m.1977.217750 · Cited by 567
Simple Constructions of Almost k‐wise Independent Random Variables
Alon, N., Goldreich, O., Håstad, J., & Peralta, R. (1992) · Random Structures & Algorithms · doi:10.1002/rsa.3240030308 · Cited by 556
Random sequence generation by cellular automata
Wolfram, S. (1986) · Advances in Applied Mathematics · doi:10.1016/0196-8858(86)90028-x · Cited by 494
The fast Fourier transform in a finite field
Pollard, J. M. (1971) · Mathematics of Computation · doi:10.1090/s0025-5718-1971-0301966-0 · Cited by 467
Turbo Coding, Turbo Equalisation and Space‐Time Coding: For Transmission over Fading Channels
Hanzo, L., Liew, T. H., & Yeap, B. L. (2002) · Wiley eBooks · doi:10.1002/047085474x · Cited by 449
The brain response interface: communication through visually-induced electrical brain responses
Sutter, E. E. (1992) · Journal of Microcomputer Applications · doi:10.1016/0745-7138(92)90045-7 · Cited by 417
Some approaches to best-match file searching
Burkhard, W. A., & Keller, R. M. (1973) · Communications of the ACM · doi:10.1145/362003.362025 · Cited by 413
Algebraic properties of cellular automata
Martin, O., Odlyzko, A. M., & Wolfram, S. (1984) · Communications in Mathematical Physics · doi:10.1007/bf01223745 · Cited by 406
Ichikawa, S., Tomita, M., Doki, S., & Okuma, S. (2006) · IEEE Transactions on Industrial Electronics · doi:10.1109/tie.2006.870875 · Cited by 383
Discrete logarithms in finite fields and their cryptographic significance
Odlyzko, A. M. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-39757-4_20 · Cited by 367
Cellular automata-based pseudorandom number generators for built-in self-test
Hortensius, P. D., McLeod, R. D., Pries, W., Miller, D. M., & Card, H. C. (1989) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/43.31545 · Cited by 350
Factoring Polynomials Over Finite Fields
Berlekamp, E. R. (1967) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1967.tb03174.x · Cited by 317
Coppersmith, D., Krawczyk, H., & Mansour, Y. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48329-2_3 · Cited by 306
Algorithm 806: SPRNG: a scalable library for pseudorandom number generation
Mascagni, M., & Srinivasan, A. (2000) · ACM Transactions on Mathematical Software · doi:10.1145/358407.358427 · Cited by 275
Efficient Design of Event-Related fMRI Experiments Using M-Sequences
Buračas, G. T., & Boynton, G. M. (2002) · NeuroImage · doi:10.1006/nimg.2002.1116 · Cited by 271
Logistic chaotic maps for binary numbers generations
Kanso, A., & Smaoui, N. (2009) · Chaos, Solitons & Fractals · doi:10.1016/j.chaos.2007.10.049 · Cited by 266
Modern Cryptography, Probabilistic Proofs and Pseudorandomness
Goldreich, O. (1999) · Algorithms and Combinatorics · doi:10.1007/978-3-662-12521-2 · Cited by 265
Feedback shift registers, 2-adic span, and combiners with memory
Klapper, A., & Goresky, M. (1997) · Journal of Cryptology · doi:10.1007/s001459900024 · Cited by 264
An analysis of the structure and complexity of nonlinear binary sequence generators
Key, E. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055626 · Cited by 259
A very fast shift-register sequence random number generator
Kirkpatrick, S., & Stoll, E. P. (1981) · Journal of Computational Physics · doi:10.1016/0021-9991(81)90227-8 · Cited by 252
Design and Implementation of a True Random Number Generator Based on Digital Circuit Artifacts
Epstein, M., Hars, L., Krasinski, R., Rosner, M., & Zheng, H. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45238-6_13 · Cited by 85
Periods on Two Kinds of nonlinear Feedback Shift Registers with Time Varying Feedback Functions
HU, H., & GONG, G. (2011) · International Journal of Foundations of Computer Science · doi:10.1142/s0129054111008738 · Cited by 51
Banik, S. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-26617-6_7 · Cited by 27
Metadata
- Authors
- Golomb, S. W.
- Venue
- WORLD SCIENTIFIC eBooks
- Publisher
- WORLD SCIENTIFIC
- Published
- 2014-09-11
- DOI
- 10.1142/9361
- OpenAlex
- W1480210121
- Cited by
- 2,180
- References
- 0
- FWCI
- 38.02
- Type
- book
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.