{"id":"W1505980332","doi":"10.1007/978-3-642-15031-9_6","title":"Efficient Techniques for High-Speed Elliptic Curve Cryptography","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Speedup; Scalar multiplication; Elliptic curve point multiplication; Curve25519; Hyperelliptic curve cryptography; Elliptic curve cryptography; Elliptic Curve Digital Signature Algorithm; Computer science; Elliptic curve; x86; Parallel computing; Tripling-oriented Doche–Icart–Kohel curve; Jacobian matrix and determinant; Hessian form of an elliptic curve; Cryptography; Arithmetic; Algorithm; Mathematics; Public-key cryptography; Applied mathematics; Encryption; Software; Programming language; Pure mathematics; Operating system","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001216456,0.0007492652,0.0007152897,0.002172799,0.0005371975,0.0007056806,0.00428911,0.0006842269,0.00001732855],"category_scores_gemma":[0.00008765931,0.0006455567,0.0004267915,0.001302444,0.001515607,0.0002164753,0.00102744,0.001293311,0.00001941767],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001012721,"about_ca_system_score_gemma":0.0003717601,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002736635,"about_ca_topic_score_gemma":0.00004962573,"domain_scores_codex":[0.9951945,0.00003456232,0.0006724452,0.002041059,0.00105651,0.001000931],"domain_scores_gemma":[0.9961051,0.000829021,0.0003762626,0.001971464,0.0004591911,0.0002589569],"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.00002046365,0.0001639327,0.00005804093,0.0001441145,0.00004549501,0.00006447111,0.0006784984,0.008913463,0.004007761,0.3519542,0.00003099784,0.6339186],"study_design_scores_gemma":[0.0005520635,0.0006220067,0.0002340422,0.0005395666,0.00003804607,0.0000808934,1.895151e-7,0.2178241,0.03445737,0.7395291,0.00447485,0.00164777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003512373,0.00054415,0.9931061,0.0007239408,0.002689264,0.001198037,0.00001559354,0.0004576345,0.0009140747],"genre_scores_gemma":[0.09715607,0.00004692168,0.9012156,0.0007861299,0.0006400695,0.00003753554,0.000007775753,0.0000561412,0.0000537886],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6322708,"threshold_uncertainty_score":0.9995996,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009903618559944876,"score_gpt":0.2346329583487652,"score_spread":0.2247293397888203,"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."}}