{"id":"W2119904820","doi":"10.1109/isit.2004.1365050","title":"Efficient key agreement and signature schemes using compact representations in GF(p/sup10/)","year":2004,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"TRACE (psycholinguistics); Key (lock); Signature (topology); Reduction (mathematics); Digital signature; Computer science; Scheme (mathematics); Bandwidth (computing); Representation (politics); Mathematics; Theoretical computer science; Discrete mathematics; Algorithm; Telecommunications; Computer security; Mathematical analysis","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":[],"consensus_categories":[],"category_scores_codex":[0.0001535784,0.00009566457,0.0001017108,0.0001632526,0.0001066417,0.0001301695,0.0002703467,0.00004090374,0.00002004675],"category_scores_gemma":[0.00001700978,0.00008365419,0.00002997845,0.0006360564,0.0000508796,0.0002000131,0.0001694195,0.000124236,0.000004770844],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003411428,"about_ca_system_score_gemma":0.00004042055,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004257452,"about_ca_topic_score_gemma":0.0001695558,"domain_scores_codex":[0.9991055,0.00002681538,0.0001577,0.0003201862,0.0001964326,0.0001933863],"domain_scores_gemma":[0.9994513,0.00003695712,0.00003563348,0.0003683738,0.00002898343,0.00007868814],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001117856,0.000541359,0.009514206,0.00002529297,0.00002431742,0.00004608537,0.004037735,0.04640615,0.009307059,0.9276592,0.000270423,0.002157061],"study_design_scores_gemma":[0.005954055,0.0003064812,0.30876,0.0002847485,0.00003336884,0.0001125338,0.001732496,0.5780314,0.01848787,0.08159637,0.003324462,0.001376249],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6312044,0.0002877965,0.3666875,0.000646489,0.00007306836,0.0001443288,0.000008042668,0.00005244043,0.0008958982],"genre_scores_gemma":[0.9268727,0.000009195421,0.07292708,0.0001682103,0.0000131057,0.000001299942,0.000003819286,0.000002275699,0.00000235277],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8460628,"threshold_uncertainty_score":0.3411319,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02180981183158999,"score_gpt":0.2861438186431697,"score_spread":0.2643340068115797,"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."}}