MétaCan
Menu
Back to cohort
Record W2119666300 · doi:10.1109/pst.2011.5971993

RC4 state and its applications

2011· article· en· W2119666300 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

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicSecurity and Verification in Computing
Canadian institutionsUniversity of Regina
Fundersnot available
KeywordsComputer scienceHash functionRC4Message authentication codeComputer networkSimple (philosophy)Overhead (engineering)Authentication (law)Distributed computingState (computer science)Cryptographic hash functionMulticastCryptographyEncryptionComputer securityStream cipherAlgorithmOperating system

Abstract

fetched live from OpenAlex

In this paper, we define the RC4 state and introduce its forward and backward property. Based on the RC4 state and its forward and backward property, a simple, lightweight, but robust security protocol which achieves data confidentiality, data authentication, data integrity, and data freshness with low overhead and simple operations is presented. Furthermore, an RC4 state based hash function for the generation of message authentication code (MAC) is presented. The proposed protocol and hash function are ideal solution for resource-constrained applications where the communication nodes have limited power resources and computational capabilities, and can be widely used in the applications of one-to-one communications as well as broadcasting and multicasting.

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: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.935
Threshold uncertainty score0.210

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.0000.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.058
GPT teacher head0.254
Teacher spread0.196 · 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

Citations11
Published2011
Admission routes1
Has abstractyes

Explore more

Same topicSecurity and Verification in ComputingFrench-language works237,207