{"id":"W2080481349","doi":"10.1145/1015047.1015054","title":"Towards fault-tolerant cryptographic computations over finite fields","year":2004,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Finite field; Cryptosystem; Cryptography; Multiplier (economics); Fault tolerance; Computation; Theoretical computer science; Realization (probability); Computer engineering; Algorithm; Distributed computing; Mathematics; Discrete mathematics","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005452455,0.0003928041,0.0004185518,0.0006655799,0.0009020116,0.0005059249,0.001695441,0.0002079191,0.00001793732],"category_scores_gemma":[0.00003853481,0.0003911686,0.0004117879,0.0018163,0.0001068348,0.0003882855,0.00004958534,0.0005841341,0.0000772715],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008599598,"about_ca_system_score_gemma":0.0001262413,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001836343,"about_ca_topic_score_gemma":0.00001718854,"domain_scores_codex":[0.9971924,0.0002363511,0.0006467069,0.0007724948,0.0005638287,0.0005882239],"domain_scores_gemma":[0.9973023,0.0005548772,0.0002025746,0.001559565,0.0001659745,0.000214722],"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.0000207738,0.0003160774,0.00002051016,0.00005686938,0.0001476675,0.00002663843,0.003993365,0.8725294,0.00007443324,0.09635885,0.00004224578,0.02641317],"study_design_scores_gemma":[0.005248402,0.001244033,0.00140601,0.001286255,0.0001496784,0.000295294,0.00135433,0.8521242,0.00103463,0.1310131,0.002766059,0.00207798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05016426,0.0001428254,0.9444045,0.000634346,0.002302326,0.0003782419,0.00001159077,0.00104572,0.0009161634],"genre_scores_gemma":[0.9560206,0.0000137892,0.04321992,0.0005135798,0.0001356381,0.00003324524,0.00000474971,0.00002946897,0.00002899881],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9058564,"threshold_uncertainty_score":0.999854,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01873030933529097,"score_gpt":0.2613728942881487,"score_spread":0.2426425849528578,"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."}}