{"id":"W2397122158","doi":"","title":"Setting Speed Records with the (Fractional) Multibase Non-Adjacent Form Method for Efficient Elliptic Curve Scalar Multiplication.","year":2008,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Scalar multiplication; Precomputation; Scalar (mathematics); Elliptic curve; Complex multiplication; Jacobian matrix and determinant; Mathematics; Computer science; Generalization; Speedup; Algorithm; Arithmetic; Applied mathematics; Pure mathematics; Parallel computing; Mathematical analysis; Geometry","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.0006512245,0.0004781591,0.0003620732,0.0007848955,0.0004815602,0.0008052741,0.0006091383,0.000456337,0.006718246],"category_scores_gemma":[0.00323095,0.0001542613,0.0003412503,0.0006605639,0.0004542971,0.002102901,0.001124528,0.0008276658,0.00246277],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002866217,"about_ca_system_score_gemma":0.0005859634,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003394176,"about_ca_topic_score_gemma":0.0004178896,"domain_scores_codex":[0.9994411,0.0001231445,0.00003629953,0.00007721548,0.0002688139,0.00005336587],"domain_scores_gemma":[0.999173,0.0002264104,0.00007209761,0.0003339481,0.0001567189,0.00003786469],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006681166,0.0001366905,0.001515905,0.000289704,0.00004342737,0.0002457805,0.0003995575,0.02053943,0.06796241,0.1300747,0.008341339,0.769783],"study_design_scores_gemma":[0.0001886361,0.00105209,0.0020354,0.0001862184,0.00007327141,0.001967315,0.0002756492,0.6436734,0.1610102,0.08776278,0.101648,0.0001270203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06576034,0.001065629,0.9197942,0.0001855556,0.0002466676,0.0001259026,0.0000712945,0.001741822,0.01100852],"genre_scores_gemma":[0.362797,0.000556953,0.6271174,0.00009002406,0.0001182053,0.0001255449,0.0001808636,0.0002740134,0.00874008],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006718246,"threshold_uncertainty_score":0.02247477,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01474522547207931,"score_gpt":0.2799320463613278,"score_spread":0.2651868208892486,"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."}}