{"id":"W2146770903","doi":"10.1109/dftvs.2005.24","title":"Concurrent error detection of polynomial basis multiplication over extension fields using a multiple-bit parity scheme","year":2006,"lang":"en","type":"article","venue":"","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Parity bit; Computer science; Cryptosystem; Parity (physics); Cryptography; Error detection and correction; Arithmetic; Finite field; Overhead (engineering); Normal basis; Algorithm; Theoretical computer science; Binary number; Mathematics; Discrete mathematics; Galois theory","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.001731213,0.0004445123,0.0005095665,0.0007079738,0.0003505011,0.0006970227,0.0006785548,0.0006193999,0.0005620876],"category_scores_gemma":[0.007957446,0.0002684995,0.0002241773,0.000502707,0.0007091961,0.001837129,0.0009285392,0.0005385702,0.0001316545],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004218193,"about_ca_system_score_gemma":0.0005282877,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002038837,"about_ca_topic_score_gemma":0.0002289806,"domain_scores_codex":[0.9986858,0.0003600121,0.00009700959,0.0001906251,0.0005395688,0.0001270232],"domain_scores_gemma":[0.9934134,0.003420541,0.001241675,0.001010979,0.0007597694,0.0001535742],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.005125597,0.0005047629,0.02420885,0.0004000645,0.0001797974,0.001864712,0.0007607582,0.1010792,0.4468812,0.03443049,0.0008786636,0.3836858],"study_design_scores_gemma":[0.0001699832,0.001452625,0.003119399,0.00003605634,0.00008607072,0.001502488,0.00006997179,0.6343227,0.34602,0.01163856,0.001522331,0.0000598287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8056238,0.0002770202,0.192227,0.0001587784,0.00004750606,0.00005049918,0.00002698373,0.0004906773,0.001097745],"genre_scores_gemma":[0.972637,0.00005905657,0.02679958,0.00001851317,0.00001266644,0.00001278162,0.00001740298,0.00001047461,0.0004325385],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001731213,"threshold_uncertainty_score":0.009155631,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0365903058726016,"score_gpt":0.3047054007526618,"score_spread":0.2681150948800602,"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."}}