MétaCan
Menu
Back to cohort
Record W2157326316 · doi:10.1093/comjnl/bxu021

Application of Simple Power Analysis to Stream Ciphers Constructed Using Feedback Shift Registers

2014· article· en· W2157326316 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

VenueThe Computer Journal · 2014
Typearticle
Languageen
FieldComputer Science
TopicError Correcting Code Techniques
Canadian institutionsMemorial University of Newfoundland
Fundersnot available
KeywordsComputer scienceStream cipherSimple (philosophy)Power (physics)Library scienceCryptographyAlgorithmPhilosophy

Abstract

fetched live from OpenAlex

Although power analysis attacks have been extensively applied to block ciphers, only limited research has been done to analyze their effectiveness on stream cipher hardware implementations. In this paper, we investigate methods of simple power analysis applied to stream ciphers based on multiple feedback shift registers (FSRs) and demonstrate the effectiveness of the methods by examining the cipher Grain which involves both a linear and a nonlinear FSR. A divide-and-conquer attack is presented where the attacker guesses the bit values of the FSRs independently and then checks the correctness of the guess using information derived from measured power consumption of the cipher core. Experimental results of the attack applied to simulated power data obtained for a CMOS implementation of Grain show that it is possible to recover directly the cipher state using only about 3000 power samples. For ciphers constructed using a general architecture of multiple FSRs, the attack has the potential to be successful with a complexity substantially less than exhaustive key search.

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: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.747
Threshold uncertainty score0.478

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.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0020.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.014
GPT teacher head0.270
Teacher spread0.256 · 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