{"id":"W1997508056","doi":"10.1145/2790282.2790291","title":"A parallel implementation for polynomial multiplication modulo a prime","year":2015,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Modulo; Modular arithmetic; Prime (order theory); Computer science; Multiplication (music); Parallel computing; Fast Fourier transform; Integer (computer science); Modular design; Polynomial; Discrete mathematics; Arithmetic; Mathematics; Combinatorics; Algorithm; Programming language","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.0001719861,0.00005814259,0.00005787155,0.00006970514,0.00005651305,0.00006909123,0.0002521856,0.00002588671,0.000003599651],"category_scores_gemma":[0.00001152192,0.00004866327,0.00004873713,0.0001601805,0.00001273423,0.0002514366,0.00005401101,0.0000221822,0.00001447918],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001862206,"about_ca_system_score_gemma":0.00005383741,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001442505,"about_ca_topic_score_gemma":0.00006562005,"domain_scores_codex":[0.9994168,0.00001698249,0.0001224134,0.0001942564,0.000107115,0.0001423965],"domain_scores_gemma":[0.999542,0.00003029823,0.00004214197,0.0002308191,0.00007575809,0.00007896065],"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.0001047306,0.0003317313,0.004398853,0.00002070201,0.00007571652,0.000001565406,0.005030904,0.0006849836,0.008254961,0.2831268,0.06402158,0.6339474],"study_design_scores_gemma":[0.01425638,0.001185159,0.04793109,0.00001249756,0.00003882051,0.00003126054,0.001257733,0.7244947,0.04693308,0.06891581,0.09391695,0.001026541],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01037057,0.00003371544,0.9866112,0.001948746,0.0001245938,0.0004038068,0.000001847264,0.0001116473,0.000393864],"genre_scores_gemma":[0.6161658,0.000001700267,0.3833608,0.000215667,0.00005560249,0.000107024,0.000008028114,0.000003325019,0.00008208529],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7238097,"threshold_uncertainty_score":0.1984431,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03695766263736489,"score_gpt":0.3134692987752822,"score_spread":0.2765116361379173,"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."}}