MétaCan
Menu
Back to cohort
Record W2006014260 · doi:10.1504/ijcnds.2009.027595

A mesh check-sum ABFT scheme for stream ciphers

2009· article· en· W2006014260 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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueInternational Journal of Communication Networks and Distributed Systems · 2009
Typearticle
Languageen
FieldComputer Science
TopicCryptographic Implementations and Security
Canadian institutionsUniversity of Regina
Fundersnot available
KeywordsComputer scienceChecksumRC4Stream cipherScheme (mathematics)Overhead (engineering)Error detection and correctionAlgorithmParallel computingCryptographyMathematics

Abstract

fetched live from OpenAlex

To enhance the security and reliability of the widely-used stream ciphers, a novel mesh check-sum ABFT scheme for stream ciphers is developed. By utilising the ready-made arithmetic unit in stream ciphers, single and multiple errors can be detected and corrected in a cheap way. To meet different requirements in practical applications, 4-D mesh check-sum ABFT scheme is proposed which can be applied to RC4 or other stream ciphers. The 2-D mesh check-sum ABFT scheme is able to detect and correct single error with high efficiency. The 4-D mesh check-sum ABFT scheme is capable of correcting up to three errors located randomly in an N-element matrix with acceptable computation and bandwidth overhead. The workload can be remarkably reduced when most communications are error-free. Our scheme also provides one-to-one mapping between index and check-sum, so that error can be located and recovered by easier logic and simpler operation.

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.001
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: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.980
Threshold uncertainty score0.420

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.000
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.019
GPT teacher head0.304
Teacher spread0.285 · 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