MétaCan
Menu
Back to cohort
Record W2146559163 · doi:10.1109/ccece.2000.849662

A low-power reduced-area ROM architecture for cryptographic algorithms

2002· article· en· W2146559163 on OpenAlexaff
M. Hileeto, S.J. Simmons

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCoding theory and cryptography
Canadian institutionsQueen's University
Fundersnot available
KeywordsComputer scienceScalabilityRead-only memoryControl logicBlock cipherOverhead (engineering)Computer hardwareEmbedded systemParallel computingCryptographyAlgorithmOperating system

Abstract

fetched live from OpenAlex

This paper describes a new low-power, reduced-area, ROM architecture for block cipher applications. It exhibits a small speed penalty compared to a more conventional ROM implementation, but has the additional advantage of scalability. Area optimization is achieved by using a single decoder, a single set of input and output circuits, a single timing and control module, but a (variable) number of programmable ROM core blocks. A small logic block, which has an insignificant area overhead, is used to select the appropriate ROM core. This approach achieves a 3 to 5-fold area savings as compared to a previous ROM structure described by McKinney (1995). Additionally, the area saving increases as the required ROM size increases.

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

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.001
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.018
GPT teacher head0.223
Teacher spread0.205 · 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 teacher head, 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

Citations0
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicCoding theory and cryptographyFrench-language works237,207