{"id":"W3029282397","doi":"","title":"Efficient compression of SIDH public keys.","year":2016,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Isogeny; Computer science; Key exchange; Public-key cryptography; Code (set theory); Key (lock); Relation (database); Theoretical computer science; Computer security; Mathematics; Encryption; Data mining; Elliptic curve; Programming language","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.0009122012,0.0004494731,0.0005219735,0.0008869806,0.0006003707,0.001235882,0.0009234617,0.0008002509,0.01064316],"category_scores_gemma":[0.006022643,0.0002854447,0.0003958436,0.00108725,0.0007897274,0.003201794,0.002790167,0.001658827,0.003639699],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006688579,"about_ca_system_score_gemma":0.001005984,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002797364,"about_ca_topic_score_gemma":0.000428569,"domain_scores_codex":[0.9984186,0.0002579407,0.00007926338,0.0001577262,0.0008984708,0.0001880638],"domain_scores_gemma":[0.997296,0.0007689459,0.0001229945,0.001353168,0.000378229,0.00008056823],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001018331,0.0002102886,0.001172268,0.0004057755,0.00007243819,0.0004991692,0.0006218097,0.02293254,0.07193774,0.4194626,0.02323779,0.4584293],"study_design_scores_gemma":[0.000213505,0.0003372229,0.001103599,0.0001303294,0.00004260846,0.001440414,0.0004574463,0.3168493,0.1752468,0.4227048,0.08139352,0.00008048751],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.113759,0.001902797,0.8201802,0.002729981,0.0009594671,0.00046688,0.001625449,0.004038699,0.05433751],"genre_scores_gemma":[0.6995713,0.0007439851,0.2767041,0.0005727105,0.0003079329,0.0003135894,0.002701577,0.0004798449,0.0186049],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01064316,"threshold_uncertainty_score":0.03560489,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01582563496823302,"score_gpt":0.2524301338346112,"score_spread":0.2366044988663782,"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."}}