{"id":"W3127874933","doi":"10.1109/tc.2007.250622","title":"Low-Weight Polynomial Form Integers for Efficient Modular Multiplication","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Modular arithmetic; Mathematics; Moduli; Elliptic curve; Mersenne prime; Integer (computer science); Polynomial; Prime (order theory); Finite field; Discrete mathematics; Multiplication (music); Cryptosystem; Arithmetic; Cryptography; Pure mathematics; Combinatorics; Computer science; Algorithm","routes":{"ca_aff":true,"ca_fund":true,"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.0001278197,0.0001987429,0.0001679576,0.0003431246,0.0003408205,0.0001222973,0.0005461674,0.00009051885,0.000003046655],"category_scores_gemma":[0.000001034525,0.0001873653,0.0002970326,0.0004775025,0.0000726569,0.000174008,0.000003503703,0.0001503509,0.00001989875],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008442506,"about_ca_system_score_gemma":0.00003742379,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007184396,"about_ca_topic_score_gemma":0.00002135594,"domain_scores_codex":[0.9986407,0.00002967216,0.0002844037,0.0004852079,0.000220254,0.0003397458],"domain_scores_gemma":[0.9990749,0.0001840588,0.00007580866,0.0004982969,0.00007827672,0.00008865994],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006595886,0.0009185484,0.000007957307,0.00003487702,0.00006432583,0.000004401867,0.0003952675,0.814854,0.005812848,0.003349405,0.001530816,0.1729616],"study_design_scores_gemma":[0.001123642,0.0001636531,0.0003219898,0.00003852065,0.00001902109,0.00001075994,0.000008991417,0.9226775,0.07374016,0.0004173093,0.001200881,0.0002776254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03480314,0.00002089932,0.9617912,0.0006092286,0.001897489,0.0005042813,0.00001420462,0.0002807672,0.00007879508],"genre_scores_gemma":[0.9197174,0.000004425261,0.07984167,0.0001746154,0.0001106805,0.000094034,0.000004326399,0.00001524048,0.00003756637],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8849143,"threshold_uncertainty_score":0.7640535,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006939187852687204,"score_gpt":0.2113589921732365,"score_spread":0.2044198043205493,"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."}}