The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Feedback shift registers, 2-adic span, and combiners with memory
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cites
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 15,999
Bhatia, R., Bredon, G. E., Walter, W. L., Rotman, J. J., Murty, M. R., Gilman, J., Walters, P., Golubitsky, M., Karatzas, I., Cohen, H., et al. (1977) · Cited by 8,252
B., T. A. A. (1946) · The Mathematical Gazette · doi:10.1017/s0025557200071461 · Cited by 7,129
Lint, J. H. (2020) · Cited by 5,023
The Art of Computer Programming. Volume 2: Seminumerical Algorithms.
Taussky, O., & Knuth, D. E. (1970) · The American Mathematical Monthly · doi:10.2307/2317055 · Cited by 3,822
An introduction to the theory of numbers
(1960) · Journal of the Franklin Institute · doi:10.1016/0016-0032(60)90676-1 · Cited by 3,574
An Introduction To The Theory Of Numbers
Hardy, G. H., & Wright, E. M. (2008) · doi:10.1093/oso/9780199219858.001.0001 · Cited by 2,624
A Course in Computational Algebraic Number Theory
Cohen, H. (1993) · Graduate Texts in Mathematics · doi:10.1007/978-3-662-02945-9 · Cited by 2,567
Golomb, S. W. (2017) · WORLD SCIENTIFIC eBooks · doi:10.1142/9361 · Cited by 2,180
A Classical Introduction to Modern Number Theory
Ireland, K., & Rosen, M. (1982) · Graduate Texts in Mathematics · doi:10.1007/978-1-4757-1779-2 · Cited by 2,069
Gallager, R. G., & Peterson, W. W. (1962) · Mathematics of Computation · doi:10.2307/2003832 · Cited by 2,041
A Classical Introduction to Modern Number Theory
Ireland, K., & Rosen, M. (1990) · Graduate texts in mathematics · doi:10.1007/978-1-4757-2103-4 · Cited by 1,311
The art of computer programming. Vol.2: Seminumerical algorithms
Knuth, D. E. (1981) · Virtual Defense Library (Ministerio de Defensa) · Cited by 1,232
Schnelle Multiplikation großer Zahlen
Schönhage, A., & Strassen, V. (1971) · Computing · doi:10.1007/bf02242355 · Cited by 1,107
Mann, H. B. (1961) · Technometrics · doi:10.1080/00401706.1961.10489978 · Cited by 1,069
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 Art of Computer Programming, Vol. 2
Knuth, D. E. (1981) · Medical Entomology and Zoology · Cited by 886
Analysis and Design of Stream Ciphers
Rueppel, R. A. (1986) · Springer eBooks · doi:10.1007/978-3-642-82865-2 · Cited by 881
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
A New Class of Random Number Generators
Marsaglia, G., & Zaman, A. (1991) · The Annals of Applied Probability · doi:10.1214/aoap/1177005878 · Cited by 370
Hooley, C. (1967) · Journal für die reine und angewandte Mathematik (Crelles Journal) · Cited by 311
Methods and Applications of Error-Free Computation
Gregory, R. T., & Krishnamurthy, E. V. (1984) · Springer eBooks · doi:10.1007/978-1-4612-5242-9 · Cited by 139
Continued fractions and Berlekamp's algorithm
Welch, L. R., & Scholtz, R. A. (1979) · IEEE Transactions on Information Theory · doi:10.1109/tit.1979.1055987 · Cited by 96
Cryptanalysis Based on 2-Adic Rational Approximation
Klapper, A., & Goresky, M. (1995) · Lecture notes in computer science · doi:10.1007/3-540-44750-4_21 · Cited by 77
Self-citationThe Shortest Feedback Shift Register That Can Generate A Given Sequence
Jansen, C. J. A., & Boekee, D. E. (2007) · Springer eBooks · doi:10.1007/0-387-34805-0_10 · Cited by 56
Advances in Cryptology — AUSCRYPT '90
(1990) · Lecture notes in computer science · doi:10.1007/bfb0030344 · Cited by 45
Large Period Nearly deBruijn FCSR Sequences
Klapper, A., & Goresky, M. (1995) · Lecture notes in computer science · doi:10.1007/3-540-49264-x_21 · Cited by 35
Self-citationFeedback registers based on ramified extensions of the 2-adic numbers: Extended abstract
Goresky, M., & Klapper, A. (1995) · Lecture notes in computer science · doi:10.1007/bfb0053437 · Cited by 35
Self-citationOn the significance of the directed acyclic word graph in cryptology
Jansen, C. J. A., & Boekee, D. E. (2006) · Springer eBooks · doi:10.1007/bfb0030372 · Cited by 8
Cited by
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
Metadata
- Authors
- Klapper, A., & Goresky, M.
- Venue
- Journal of Cryptology
- Published
- 1997-03
- Volume
- 10
- Issue
- 2
- Pages
- 111-147
- ISSN
- 0933-2790 (ISSN-L)
- 1432-1378
- OpenAlex
- W2163925910
- Cited by
- 264
- References
- 30
- FWCI
- 2.85
- Type
- journal article
- Language
- en
- Open access
- bronze
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.