Pith. Sign in

RECORD

Insights Gained after a Decade of Cellular Automata-based Cryptography

PaperPDF from arXiv

data files

Paper breakdownThe authors' claims, conditions and measurements, as JSON Signed receiptProof this review has not been altered
X Bluesky LinkedIn Reddit Hacker News
Luca Mariot

Cryptography and Security · Submitted 5 May 2024

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim This observation indicates that there is still ample room for fruitful collaborations between the CA and cryptography communities in the future.

how it is stated · hedged possibility 1.00 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID2405.02875 (version 1)
Pith IDZMZKPJ4R, Pith's permanent record of this paper and its review
CitationLuca Mariot. "Insights Gained after a Decade of Cellular Automata-based Cryptography." arXiv:2405.02875 (2024). https://pith.science/paper/ZMZKPJ4R
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 5,538 input tokens.

What the abstract itself states, as probabilities: claims first 0.03 · states limitation 0.41 · human participants 0.02 · controlled comparison 0.02 · randomized assignment 0.01 · states quantitative result 0.03 · compares with prior results 0.11 · mentions code or data availability 0.02.

The abstract, sentence by sentence

arXiv listing abstract v1. Results and the main claim are underlined; .

Cellular Automata (CA) have been extensively used to implement symmetric cryptographic primitives, such as pseudorandom number generators and S-boxes. However, most of the research in this field, except the very early works, seems to be published in non-cryptographic venues. This phenomenon poses a problem of relevance: are CA of any use to cryptographers nowadays? This paper provides insights into this question by briefly outlining the history of CA-based cryptography. In doing so, the paper identifies some shortcomings in the research addressing the design of symmetric primitives exclusively from a CA standpoint, alongside some recommendations for future research. Notably, the paper remarks that researchers working in CA and cryptography often tackle similar problems, albeit under different perspectives and terminologies. This observation indicates that there is still ample room for fruitful collaborations between the CA and cryptography communities in the future.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 Cellular Automata (CA) have been extensively used to implement symmetric cryptographic primitives, such as pseudorandom number generators and S-boxes. background 1.00 0.05 0.02 asserted 1.00
s1 However, most of the research in this field, except the very early works, seems to be published in non-cryptographic venues. background 0.63 0.16 0.03 asserted 0.53
s2 This phenomenon poses a problem of relevance: are CA of any use to cryptographers nowadays? background 0.54 0.08 0.03 asserted 0.91
s3 This paper provides insights into this question by briefly outlining the history of CA-based cryptography. contribution 0.95 0.83 0.05 asserted 1.00
s4 In doing so, the paper identifies some shortcomings in the research addressing the design of symmetric primitives exclusively from a CA standpoint, alongside some recommendations for future research. contribution 0.89 0.85 0.15 asserted 1.00
s5 Notably, the paper remarks that researchers working in CA and cryptography often tackle similar problems, albeit under different perspectives and terminologies. result 0.74 0.50 0.12 asserted 0.85
s6 This observation indicates that there is still ample room for fruitful collaborations between the CA and cryptography communities in the future. interpretation 0.78 0.50 0.50 hedged possibility 1.00

What kind of paper the classifier reports this is: review 0.88 · evidence from literature 0.92.

What was examined, and what was not

sources read
  • arXiv listing abstract v1
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original abstract

Cellular Automata (CA) have been extensively used to implement symmetric cryptographic primitives, such as pseudorandom number generators and S-boxes. However, most of the research in this field, except the very early works, seems to be published in non-cryptographic venues. This phenomenon poses a problem of relevance: are CA of any use to cryptographers nowadays? This paper provides insights into this question by briefly outlining the history of CA-based cryptography. In doing so, the paper identifies some shortcomings in the research addressing the design of symmetric primitives exclusively from a CA standpoint, alongside some recommendations for future research. Notably, the paper remarks that researchers working in CA and cryptography often tackle similar problems, albeit under different perspectives and terminologies. This observation indicates that there is still ample room for fruitful collaborations between the CA and cryptography communities in the future.

Human review

How Pith checks papers → · Full audit of this paper →

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.