MétaCan
Menu
Back to cohort
Record W2116517406

Techniques of Side Channel Cryptanalysis

2001· dissertation· en· W2116517406 on OpenAlexfundno aff
James A. Muir

Bibliographic record

VenueUWSpace (University of Waterloo) · 2001
Typedissertation
Languageen
FieldComputer Science
TopicCryptographic Implementations and Security
Canadian institutionsnot available
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsSide channel attackCryptanalysisComputer scienceBoomerang attackLinear cryptanalysisComputer securityCryptography
DOInot available

Abstract

fetched live from OpenAlex

I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis,including any required final revisions,as accepted by my examiners. I understand that my thesis may be made electronically available to the public. ii The traditional model of cryptography examines the security of cryptographic prim-itives as mathematical functions. This approach does not account for the physical side effects of using these primitives in the real world. A more realistic model em-ploys the concept of a side channel. A side channel is a source of information that is inherent to a physical implementation of a primitive. Research done in the last half of the 1990s has shown that the information transmitted by side channels,such as execution time,computational faults and power consumption,can be detrimental to the security of ciphers like DES and RSA. This thesis surveys the techniques of side channel cryptanalysis presented in [30], [10],and [31] and shows how side channel information can be used to break imple-mentations of DES and RSA. Some specific techniques covered include the timing attack,differential fault analysis,simple power analysis and differential power anal-ysis. Possible defenses against each of these side channel attacks are also discussed. iii

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.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.006
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.013
Threshold uncertainty score0.044

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.006
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0030.002
Science and technology studies0.0010.003
Scholarly communication0.0030.005
Open science0.0010.003
Research integrity0.0020.005
Insufficient payload (model declined to judge)0.0130.006

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.012
GPT teacher head0.228
Teacher spread0.217 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations21
Published2001
Admission routes1
Has abstractyes

Explore more

Same venueUWSpace (University of Waterloo)Same topicCryptographic Implementations and SecurityFrench-language works237,207