{"id":"W3029166298","doi":"","title":"Novel Precomputation Schemes for Elliptic Curve Cryptosystems.","year":2008,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Scalar multiplication; Precomputation; Elliptic curve point multiplication; Hessian form of an elliptic curve; Elliptic curve; Elliptic curve cryptography; Scalar (mathematics); Tripling-oriented Doche–Icart–Kohel curve; Computer science; Mathematics; Edwards curve; Elliptic Curve Digital Signature Algorithm; Schoof's algorithm; Supersingular elliptic curve; Arithmetic; Algebra over a field; Algorithm; Pure mathematics; Computation; Quarter period; Public-key cryptography; Geometry; Encryption","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.001291591,0.0007451177,0.0006682822,0.0007966434,0.001141118,0.002275458,0.001272716,0.001096007,0.01011025],"category_scores_gemma":[0.003863723,0.0004227917,0.0004798847,0.00103594,0.00106419,0.00435007,0.002725768,0.002683705,0.00347785],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007948258,"about_ca_system_score_gemma":0.0009882239,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001267067,"about_ca_topic_score_gemma":0.0003223465,"domain_scores_codex":[0.9986513,0.0002892006,0.0001214366,0.0002042668,0.0005464579,0.000187318],"domain_scores_gemma":[0.9982595,0.0004017843,0.000124941,0.0008288984,0.0002725298,0.0001123341],"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.001034504,0.0004184745,0.0004233119,0.0003833623,0.00005321056,0.0003982105,0.0004711881,0.005049315,0.05540851,0.619326,0.01517078,0.301863],"study_design_scores_gemma":[0.0006952779,0.001133075,0.0007862619,0.0002154587,0.0001423772,0.004463743,0.0002574232,0.08158539,0.1138476,0.6422442,0.1544628,0.0001664355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1169867,0.005716104,0.802182,0.002579555,0.001617376,0.0006375951,0.0005351596,0.002769683,0.06697596],"genre_scores_gemma":[0.5961442,0.002519753,0.360743,0.000760571,0.0009525615,0.0003671489,0.0009330368,0.0002547931,0.03732492],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01011025,"threshold_uncertainty_score":0.03382218,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02837152545129713,"score_gpt":0.2737843148792287,"score_spread":0.2454127894279315,"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."}}