MétaCan
Menu
Back to cohort
Record W2376208633

A Fast Implementation of Montgomery Algorithm on ARM

2006· article· en· W2376208633 on OpenAlexvenueno aff
JI Xiao-yong

Bibliographic record

VenueMicrocomputer applications · 2006
Typearticle
Languageen
FieldComputer Science
TopicCryptography and Residue Arithmetic
Canadian institutionsnot available
Fundersnot available
KeywordsComputer scienceModular arithmeticMultiplication (music)ElGamal encryptionModular designMultiplication algorithmAlgorithmCryptographyKey (lock)Public-key cryptographyARM architectureArithmeticEmbedded systemEncryptionMathematicsComputer securityOperating system
DOInot available

Abstract

fetched live from OpenAlex

Montgomery algorithm is a fast modular multiplication algorithm and has been widely used in the basic operation of public key cryptography algorithms such as RSA and ElGamal. However, there're few papers focusing on it theoretically and systematically. The algorithm is analyzed deeply and deduced systematically in this paper. Based on ARM chip, Montgomery Algorithm is optimized so that it can enhance the implementation speed of modular multiplication in RSA algorithm.

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: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.917
Threshold uncertainty score0.447

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.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.004
GPT teacher head0.237
Teacher spread0.233 · 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 designOther design
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
Published2006
Admission routes1
Has abstractyes

Explore more

Same venueMicrocomputer applicationsSame topicCryptography and Residue ArithmeticFrench-language works237,207