MétaCan
Menu
Back to cohort

Speeding Up RSA and Elliptic Curve Systems by Choosing Suitable Moduli

2004· book-chapter· en· W11672901 on OpenAlexaff
Huapeng Wu, M.A. Hasan, Ian F. Blake

Bibliographic record

VenueBirkhäuser Basel eBooks · 2004
Typebook-chapter
Languageen
FieldComputer Science
TopicCryptography and Residue Arithmetic
Canadian institutionsUniversity of TorontoUniversity of WaterlooUniversity of Windsor
Fundersnot available
KeywordsModuliOperandModular equationElliptic curveModulusMathematicsModular elliptic curveSubtractionCryptosystemArithmeticModular arithmeticModular designDiscrete mathematicsAlgebra over a fieldPure mathematicsAlgorithmComputer scienceQuarter periodCryptographyGeometryPhysicsModuli of algebraic curvesModuli spaceOperating system

Abstract

fetched live from OpenAlex

In this paper we propose a method to speed up the modular operation by choosing suitable moduli. When the modulus N can be represented as a sum of a few positive or negative powers of 2, we show that a modular operation (X mod N),where X is not greater than the square of the modulus N,can be computed with a few addition/subtraction operations with the operands of about the same size as the modulus. No evidence has been shown that use of such moduli in RSA and elliptic curve cryptosystems can compromise the security of the systems. Mathematics Subject Classification (2000). Primary 68W99; Secondary 94A60.

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 categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Other · Consensus signal: Other
Teacher disagreement score0.786
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0010.000
Open science0.0010.000
Research integrity0.0010.001
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.016
GPT teacher head0.205
Teacher spread0.188 · 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.

Study designTheoretical or conceptual
Domainnot available
GenreOther

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
Published2004
Admission routes1
Has abstractyes

Explore more

Same venueBirkhäuser Basel eBooksSame topicCryptography and Residue ArithmeticFrench-language works237,207