{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006776252,0.001975687,0.0008773303,0.00227802,0.001005624,0.00219198,0.001829586,0.001027392,0.01872286],"category_scores_gemma":[0.002277819,0.0009956942,0.0008678416,0.002936296,0.0009606828,0.006450388,0.00229742,0.003064183,0.009783252],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007860609,"about_ca_system_score_gemma":0.0005863301,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001861514,"about_ca_topic_score_gemma":0.0003877638,"domain_scores_codex":[0.9987701,0.0001743691,0.00006359748,0.0001171232,0.0007603797,0.00011456],"domain_scores_gemma":[0.9991084,0.0002799851,0.00005603019,0.0003592684,0.0001696043,0.00002676782],"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.0002753303,0.0001424351,0.000204096,0.0008275434,0.00008850385,0.0001339704,0.0001967413,0.01231769,0.036065,0.3047616,0.02565078,0.6193362],"study_design_scores_gemma":[0.0002361785,0.0002854834,0.0005557218,0.0003884615,0.0001461219,0.001559175,0.0001322863,0.1031475,0.0855607,0.5431687,0.2647031,0.0001166877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007143899,0.0109659,0.9403958,0.0006553734,0.0005409498,0.0001424084,0.0001443267,0.001874454,0.03813696],"genre_scores_gemma":[0.1495297,0.01684177,0.7714238,0.0003976798,0.001219789,0.0002905467,0.0006687129,0.0008437191,0.05878423],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01872286,"threshold_uncertainty_score":0.06263423,"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."}}