{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001324762,0.000867235,0.0005409925,0.001218772,0.0005888122,0.001636276,0.00132649,0.001534969,0.001348039],"category_scores_gemma":[0.003932401,0.0004317136,0.0005231071,0.001011361,0.00183863,0.003322194,0.001472065,0.00263579,0.0007455255],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006730128,"about_ca_system_score_gemma":0.0008092881,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000283251,"about_ca_topic_score_gemma":0.0002856233,"domain_scores_codex":[0.9991122,0.0002247333,0.00005743976,0.000103795,0.0004229268,0.00007891237],"domain_scores_gemma":[0.9978244,0.0009611823,0.000297518,0.0004545958,0.0003788732,0.00008350151],"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.0002819362,0.0001530304,0.0007349497,0.000534131,0.0000381406,0.0005374494,0.0005091979,0.096511,0.04372207,0.7397001,0.002646517,0.1146315],"study_design_scores_gemma":[0.00006594637,0.0002481732,0.0001383336,0.00009945903,0.00003257224,0.0006808852,0.0001667433,0.3810479,0.03046117,0.5703375,0.01668241,0.00003887635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04976925,0.001343597,0.9408568,0.001353134,0.0001922542,0.0000608279,0.00002934697,0.0003611537,0.00603353],"genre_scores_gemma":[0.4931386,0.004729167,0.494855,0.000652845,0.0005077515,0.0001323111,0.0001336883,0.0000846867,0.005766092],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001636276,"threshold_uncertainty_score":0.007006049,"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."}}