{"id":"W1589435896","doi":"10.1002/9780470050118.ecse152","title":"Algorithm‐Based Fault‐Tolerant Cryptography","year":2009,"lang":"en","type":"other","venue":"Wiley Encyclopedia of Computer Science and Engineering","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Checksum; Hash function; Fault tolerance; Cryptosystem; Algorithm; Redundancy (engineering); Cryptography; Overhead (engineering); Encryption; Error detection and correction; Parallel computing; Distributed computing; Computer network","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.0005858456,0.0003921975,0.000397448,0.0010562,0.0005675236,0.001404016,0.0008567917,0.0006685277,0.004139586],"category_scores_gemma":[0.00163271,0.0001559368,0.0002911029,0.001009074,0.0007156992,0.001973466,0.001083297,0.0008107758,0.001436332],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007120852,"about_ca_system_score_gemma":0.0006170568,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002583683,"about_ca_topic_score_gemma":0.0001420376,"domain_scores_codex":[0.9991251,0.0001714608,0.0000733604,0.00009363166,0.0004331619,0.0001033384],"domain_scores_gemma":[0.9990332,0.0001873991,0.0001135559,0.00037594,0.0002591729,0.00003076541],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0005335117,0.0001029934,0.0006883248,0.0003413114,0.00004731511,0.0002245005,0.0001953993,0.08324235,0.0495914,0.5420134,0.00908396,0.3139355],"study_design_scores_gemma":[0.000148103,0.0003206093,0.0003908841,0.00009281399,0.00004087901,0.0006477462,0.00004953776,0.6386135,0.08392147,0.2188164,0.05689325,0.00006479528],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03839328,0.001515017,0.9346724,0.0005578726,0.0003376818,0.0001363588,0.00009554932,0.001369703,0.02292209],"genre_scores_gemma":[0.8220937,0.00119623,0.1627017,0.0002463557,0.0002236238,0.000136592,0.0002317929,0.0000969724,0.01307305],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004139586,"threshold_uncertainty_score":0.01384825,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005453195885895181,"score_gpt":0.2179481397252952,"score_spread":0.2124949438394,"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."}}