{"id":"W1969742447","doi":"10.1049/iet-ifs.2010.0271","title":"On the generalisation of special moduli for faster interleaved montgomery modular multiplication","year":2013,"lang":"en","type":"article","venue":"IET Information Security","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Instituto de Sistemas Complejos de Ingeniería","keywords":"Moduli; Elliptic curve cryptography; Modular arithmetic; Elliptic curve; Multiplication (music); Mathematics; Modular equation; Integer (computer science); Arithmetic; Cryptography; Prime (order theory); Elliptic curve point multiplication; Modular design; Discrete mathematics; Algebra over a field; Computer science; Algorithm; Pure mathematics; Public-key cryptography; Moduli of algebraic curves; Moduli space; Combinatorics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002503338,0.00009152169,0.00009619076,0.0001300528,0.0001089112,0.0001413117,0.0003832005,0.00006000913,0.0000344211],"category_scores_gemma":[0.00006820137,0.00006395129,0.00009828233,0.0002240429,0.00004312296,0.001673579,0.0000571581,0.00007867388,0.0000681735],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001864949,"about_ca_system_score_gemma":0.00001427411,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006099472,"about_ca_topic_score_gemma":0.000006653923,"domain_scores_codex":[0.9991634,0.00004261307,0.0003420876,0.0001040944,0.0002213365,0.0001263922],"domain_scores_gemma":[0.9989766,0.0001268974,0.0002119636,0.0003943735,0.0002564917,0.00003366691],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004162892,0.0001527534,0.0002116269,0.00009511968,0.00005282546,6.795694e-8,0.02749154,0.003000868,0.001717311,0.8693331,0.01768807,0.08021513],"study_design_scores_gemma":[0.0006686337,0.0001392877,0.01316924,0.00002367236,0.000006956644,0.000001621806,0.0003829478,0.8506668,0.01179379,0.117434,0.005522135,0.0001909238],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4975519,0.000007040362,0.4978847,0.002179133,0.0003135566,0.0008177862,0.00001432947,0.00004609989,0.00118548],"genre_scores_gemma":[0.9949933,0.000005362388,0.004065137,0.0006302811,0.000120204,0.0001476803,0.00002724341,0.000002716283,0.000008109168],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.847666,"threshold_uncertainty_score":0.2607858,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01157476058275508,"score_gpt":0.2114745024822962,"score_spread":0.1998997418995411,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}