The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
A computer package for measuring the strength of encryption algorithms
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“This test is a specification of one of the tests coming from the DIEHARD [1] battery of tests. It is based on the result of Kovalenko [2] and also formulated by Marsaglia and Tsay [3].”
From A statistical test suite for random and pseudorandom number generators for cryptographic applications (2010) · cites this paper as [3]
In the citing paper
“The result states that the rank R of the Mx Q random binary matrix takes values r = 0, 1, 2, …, m where m ≡ min ( M , Q ) with probabilities”
From A statistical test suite for random and pseudorandom number generators for cryptographic applications (2010) · cites this paper as [3]
In the citing paper
“Then ∇ψ m 2 has a Χ 2 -distribution with 2 m -1 degrees of freedom, and ∇ 2 ψ m has a Χ 2 -distribution with 2 m -2 degrees of freedom.”
From A statistical test suite for random and pseudorandom number generators for cryptographic applications (2010) · cites this paper as [3]
In the citing paper
“The limiting distribution of n [ log2 -ApEn ( m ) ] coincides with that of a Χ 2 -random variable with 2 m degrees of freedom.”
From A statistical test suite for random and pseudorandom number generators for cryptographic applications (2010) · cites this paper as [3]
In the citing paper
“Then ∇ψ m 2 has a Χ 2 -distribution with 2 m -1 degrees of freedom, and ∇ 2 ψ m has a Χ 2 -distribution with 2 m -2 degrees of freedom.”
From A statistical test suite for random and pseudorandom number generators for cryptographic applications (2010) · cites this paper as [3]
Citations
Cites
A Non-Parametric Approach to the Change-Point Problem
Pettitt, A. N. (1979) · Applied Statistics · doi:10.2307/2346729 · Cited by 4,114
On the Complexity of Finite Sequences
Lempel, A., & Ziv, J. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055501 · Cited by 2,717
Shift-register synthesis and BCH decoding
Massey, J. (1969) · IEEE Transactions on Information Theory · doi:10.1109/tit.1969.1054260 · Cited by 2,186
Analysis and Design of Stream Ciphers
Rueppel, R. A. (1986) · Springer eBooks · doi:10.1007/978-3-642-82865-2 · Cited by 881
Webster, A. F., & Tavares, S. E. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-39799-x_41 · Cited by 719
Statistical Concepts and Methods
Postelnicu, T., Bhattacharyya, G. K., & Johnson, R. A. (1980) · International Statistical Review / Revue Internationale de Statistique · doi:10.2307/1402949 · Cited by 676
Advances in Cryptology — CRYPTO’ 86: Proceedings
(1987) · Lecture Notes in Computer Science · doi:10.1007/3-540-47721-7 · Cited by 519
Privacy and authentication: An introduction to cryptography
Diffie, W., & Hellman, M. E. (1979) · Proceedings of the IEEE · doi:10.1109/proc.1979.11256 · Cited by 470
The Distribution Theory of Runs
Mood, A. M. (1940) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177731825 · Cited by 457
Statistical Concepts and Methods.
Harper, D., Bhattacharyga, G. K., Johnson, R. A., Hanushek, E. A., Jackson, J. E., Mueller, J. H., Schuessler, K. F., & Costner, H. L. (1978) · Contemporary Sociology · doi:10.2307/2064699 · Cited by 413
A universal statistical test for random bit generators
Maurer, U. M. (1992) · Journal of Cryptology · doi:10.1007/bf00193563 · Cited by 263
6 Combination of independent tests
Folks, J. L. (1984) · Handbook of statistics · doi:10.1016/s0169-7161(84)04008-6 · Cited by 237
Stephens, M. A. (2017) · Routledge eBooks · doi:10.1201/9780203753064-4 · Cited by 179
Cipher Systems: The Protection of Communications
Beker, H. J., Piper, F. C., & Hopkins, J. E. (1982) · Cited by 162
Wiener, M. J. (1993) · Cited by 142
CIPHER SYSTEMS: The Protection of Communications
Wiegold, J. (1983) · Bulletin of the London Mathematical Society · doi:10.1112/blms/15.5.521 · Cited by 139
Aspects of local linear complexity
Carter, G. (1989) · Royal Holloway Digital Repository (Royal Holloway University of London) · Cited by 15
COMPUTER METHODS FOR DECRYPTING RANDOM STREAM CIPHERS
Rubin, F. (1978) · Cryptologia · doi:10.1080/0161-117891853027 · Cited by 10
Cited by
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Bassham, L. E., Rukhin, A. L., Soto, J., Nechvatal, J. R., Smid, M. E., Barker, E. B., Leigh, S. D., Levenson, M., Vangel, M., Banks, D. L., et al. (2010) · NIST Special Publication 800-22 Revision 1a · doi:10.6028/nist.sp.800-22r1a · Cited by 3,617
“S3 = BinExp[Sqrt[3],302500]; Save["data.”
InfluentialRukhin, A., Sota, J., Nechvatal, J., Smid, M., Barker, E., Leigh, S., Levenson, M., Vangel, M., Banks, D., Heckert, A., et al. (2000) · doi:10.6028/nist.sp.800-22 · Cited by 1,867
Hyperchaotic encryption based on multi-scroll piecewise linear systems
García-Martínez, M., Ontañón-García, L. J., Campos-Cantón, E., & Čelikovský, S. (2015) · Applied Mathematics and Computation · doi:10.1016/j.amc.2015.08.037 · Cited by 59
Distribution of the number of visits of a random walk
Baron, M., & Rukhin, A. L. (1999) · Communications in Statistics. Stochastic Models · doi:10.1080/15326349908807552 · Cited by 17
Metadata
- Authors
- Gustafson, H., Dawson, E., Nielsen, L., & Caelli, W.
- Affiliations
- Queensland University of Technology (AU)
- ORCID
- Dawson, E.
- Venue
- Computers & Security
- Publisher
- Elsevier BV
- Published
- 1994-01
- Volume
- 13
- Issue
- 8
- Pages
- 687-697
- ISSN
- 0167-4048 (ISSN-L)
- OpenAlex
- W1976634091
- Cited by
- 104
- References
- 18
- Citations by year
- 2026: 1 · 2024: 6 · 2023: 3 · 2022: 5 · 2021: 6 · 2020: 4 · 2019: 2 · 2018: 3 · 2017: 7 · 2016: 5 · 2015: 13 · 2014: 5 · 2013: 8 · 2012: 2
- FWCI
- 1.03
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.elsevier.com/tdm/userlicense/1.0/ (tdm)
- Locations
- Computers & Security (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Cryptographic Implementations and Security
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Coding theory and cryptography
- Physical Sciences › Computer Science › Artificial Intelligence › Computer Science and Engineering
- Keywords
- cryptanalysis, cipher design
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.
