{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008148234,0.000969237,0.0006461986,0.00105967,0.0005774455,0.001204216,0.00105761,0.0008157421,0.003848568],"category_scores_gemma":[0.00200918,0.0003616299,0.0009750688,0.0008993547,0.0009534949,0.003491869,0.001404288,0.001922518,0.001269973],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004965989,"about_ca_system_score_gemma":0.0004334586,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001976622,"about_ca_topic_score_gemma":0.0003097476,"domain_scores_codex":[0.9992544,0.0001608168,0.00008961221,0.0001652866,0.0002431651,0.00008682581],"domain_scores_gemma":[0.9992588,0.0001994006,0.00006797528,0.0003411871,0.000108223,0.00002423243],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006109782,0.0001627872,0.0009762901,0.0005440871,0.0001038192,0.0005359321,0.0005882263,0.02151599,0.1160525,0.4967818,0.003363847,0.3587638],"study_design_scores_gemma":[0.0002410884,0.00128475,0.001277305,0.0002668509,0.0002207414,0.003713931,0.0001769954,0.292417,0.2408245,0.3001541,0.1592017,0.0002211464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0244798,0.0006375363,0.9647118,0.0002035448,0.0001980765,0.0001567935,0.00002610447,0.0006413425,0.008944952],"genre_scores_gemma":[0.3228043,0.0009729693,0.6673638,0.0002952245,0.0003075003,0.0002004023,0.0001791898,0.0002303856,0.007646267],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003848568,"threshold_uncertainty_score":0.01287478,"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."}}