MétaCan
Menu
Back to cohort
Record W4308825006 · doi:10.1109/cas56377.2022.9934500

Encryption Algorithm using Linear Hybrid Cellular Automaton

2022· article· en· W4308825006 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

fundA Canadian funder is recorded on the work.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCellular Automata and Applications
Canadian institutionsnot available
FundersOntario Ministry of Research, Innovation and Science
KeywordsComputer scienceEncryptionVHDLCorrectnessHardware description languageAlgorithmKey (lock)Stream cipherField-programmable gate arrayBlock cipherSymmetric-key algorithmCryptographyTheoretical computer scienceEmbedded systemPublic-key cryptographyComputer networkOperating system

Abstract

fetched live from OpenAlex

This paper presents a data encryption/decryption algorithm based on a one-dimensional Linear Hybrid Cellular Automaton (LHCA) with a combination of rule 90 and 150. The proposed solution is a stream cipher algorithm that uses a symmetric key to encrypt and decrypt a given amount of data. Hardware implementation was used to simulate the proposed algorithm operation and the experimental results are presented for different data to illustrate correctness of encryption and decryption processes. Design and simulations have been performed using VHDL hardware description language for FPGA implementation and C# programming language for application that communicates with the board.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.917
Threshold uncertainty score0.391

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.001
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.017
GPT teacher head0.241
Teacher spread0.224 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Quick stats

Citations7
Published2022
Admission routes1
Has abstractyes

Explore more

Same topicCellular Automata and ApplicationsFrench-language works237,207