MétaCan
Menu
Back to cohort
Record W2120187795 · doi:10.1109/iscas.2005.1465669

Efficient Multi-Prime RSA Immune against Hardware Fault Attack

2005· article· en· W2120187795 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
TopicChaos-based Image/Signal Encryption
Canadian institutionsWestern University
Fundersnot available
KeywordsChinese remainder theoremComputer sciencePrime (order theory)Field-programmable gate arrayFactorizationPrime numberPrime factorProtocol (science)Parallel computingArithmeticEmbedded systemTheoretical computer scienceAlgorithmMathematicsDiscrete mathematicsCombinatorics

Abstract

fetched live from OpenAlex

In this paper, a study on the factorization analysis and improvement of the Chinese remainder theorem (CRT)-based multi-prime RSA against the hardware fault attack is carried out. A novel immune CRT-based multi-prime RSA is proposed and its properties in terms of the factorization complexity and operation speed are compared with those of the extended CRT-2 protocol (S. Yen et al, IEEE Trans. on computers, vol.52, p.461-472, 2003). The proposed multi-prime RSA and the extended CRT-2 protocol applied in a three-prime RSA are implemented using FPGA technology. The implementation results show that the proposed immune multi-prime RSA is 30% faster while requiring only 75% of the hardware resources, compared to the extended CRT-2 RSA protocol.

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 categoriesInsufficient payload (model declined to judge)
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.752
Threshold uncertainty score0.997

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.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.003

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.023
GPT teacher head0.271
Teacher spread0.247 · 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

Citations2
Published2005
Admission routes1
Has abstractyes

Explore more

Same topicChaos-based Image/Signal EncryptionFrench-language works237,207