{"id":"W2950802487","doi":"","title":"Efficient Techniques for High-Speed Elliptic Curve Cryptography.","year":2010,"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":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Speedup; Elliptic curve point multiplication; Curve25519; Scalar multiplication; Elliptic Curve Digital Signature Algorithm; Computer science; Hyperelliptic curve cryptography; Elliptic curve cryptography; Elliptic curve; Tripling-oriented Doche–Icart–Kohel curve; Parallel computing; Jacobian matrix and determinant; x86; Hessian form of an elliptic curve; Cryptography; Arithmetic; Algorithm; Mathematics; Public-key cryptography; Applied mathematics; Encryption; Software; Programming language; Mathematical analysis; 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","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0009711057,0.001008071,0.001271381,0.001489756,0.0004928883,0.0003268743,0.004047527,0.001181617,0.00004671879],"category_scores_gemma":[0.0002289481,0.0009451796,0.001160738,0.0005850859,0.001176761,0.00007697586,0.004162165,0.002968504,0.00008330095],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005544904,"about_ca_system_score_gemma":0.0003608029,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001197859,"about_ca_topic_score_gemma":0.0001016658,"domain_scores_codex":[0.9942104,0.0004334589,0.001076902,0.002391761,0.0005334768,0.001353971],"domain_scores_gemma":[0.9941399,0.001313815,0.0007432008,0.003023937,0.0003807028,0.0003984621],"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.00007065781,0.0004105876,0.0006422302,0.0002192386,0.0002886062,0.00005150296,0.00105991,0.001131127,0.004758717,0.978783,0.0004494186,0.01213505],"study_design_scores_gemma":[0.0006241036,0.0002649713,0.004866981,0.000171386,0.0001179962,0.00007064221,0.00003107897,0.0217931,0.01204147,0.9561962,0.002716118,0.001105883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07332283,0.0003645795,0.9160516,0.001920264,0.003213234,0.002566717,0.0001487241,0.001109406,0.001302645],"genre_scores_gemma":[0.1511624,0.0001329438,0.8471152,0.0002940922,0.0004213582,0.000705023,0.00009191669,0.0000756196,0.000001513932],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.07783955,"threshold_uncertainty_score":0.9993317,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01186944684658742,"score_gpt":0.2587890616558372,"score_spread":0.2469196148092498,"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."}}