{"id":"W2057734830","doi":"10.1109/pacrim.2013.6625466","title":"New and improved word-based unified and scalable architecture for radix 2 Montgomery modular multiplication algorithm","year":2013,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Adder; Computer science; Scalability; Operand; Parallel computing; Modular arithmetic; Application-specific integrated circuit; Throughput; Arithmetic; Word (group theory); Critical path method; Modular design; Multiplication (music); Architecture; Multiplication algorithm; Algorithm; Computer hardware; Binary number; Mathematics; Latency (audio); Engineering; Cryptography","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.00009913329,0.000133425,0.000133741,0.000135868,0.0001340212,0.0002142827,0.0002195887,0.00007476416,0.000008981824],"category_scores_gemma":[0.00001412412,0.0001035158,0.00004531937,0.0002564523,0.00005073489,0.0002309798,0.00007098292,0.00007877715,0.000002053574],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005483256,"about_ca_system_score_gemma":0.00003500445,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005992807,"about_ca_topic_score_gemma":0.00002984143,"domain_scores_codex":[0.9991336,0.00002049188,0.0001389068,0.000390677,0.00008678145,0.0002295543],"domain_scores_gemma":[0.9992394,0.0001334453,0.00004434555,0.0003481125,0.0000588924,0.0001758149],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000545946,0.00002721617,0.0001264729,0.00001737261,0.00001921079,3.2998e-7,0.0001261064,0.0001234397,0.01067834,0.001512451,0.0005166198,0.986847],"study_design_scores_gemma":[0.001269918,0.0001032745,0.01083572,0.00001131628,0.0000131313,0.000005901697,0.00001722729,0.959805,0.007243703,0.01875788,0.001726128,0.0002107594],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0216335,0.0006214046,0.9742991,0.002501056,0.00005709235,0.0007117643,0.000001968951,0.0001202475,0.00005387932],"genre_scores_gemma":[0.1271225,0.00002121415,0.8721603,0.0002945371,0.00004112468,0.00008467206,0.000004515073,0.000009133137,0.0002619884],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9866362,"threshold_uncertainty_score":0.4221251,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005954661384605956,"score_gpt":0.2011921438027112,"score_spread":0.1952374824181053,"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."}}