{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006940015,0.0009850613,0.0004889962,0.001415904,0.0005861067,0.000984067,0.0007895469,0.0005614416,0.01005899],"category_scores_gemma":[0.001615505,0.0004008485,0.0005997567,0.001435557,0.0006378967,0.002404462,0.001321235,0.001325724,0.00612807],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004492257,"about_ca_system_score_gemma":0.0005946411,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001329628,"about_ca_topic_score_gemma":0.0003226976,"domain_scores_codex":[0.9991885,0.0001610047,0.00004355591,0.00006009552,0.000481308,0.00006545772],"domain_scores_gemma":[0.9995409,0.0001112523,0.00005191254,0.0001814431,0.00009898932,0.00001547166],"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.0002832669,0.0001343979,0.0005028925,0.0006756518,0.00009688455,0.0002083614,0.0001781266,0.01872398,0.07916157,0.2064684,0.01350091,0.6800656],"study_design_scores_gemma":[0.0003434328,0.0005885428,0.001275322,0.0003317497,0.0001434058,0.002480279,0.000197518,0.2384126,0.1729015,0.3742992,0.2089206,0.0001058954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01519591,0.004630132,0.962575,0.0005461669,0.0003379572,0.0001438686,0.0001002037,0.001315754,0.01515514],"genre_scores_gemma":[0.1966125,0.004159028,0.7751525,0.000200546,0.0002884092,0.0001962929,0.0004974776,0.0003936606,0.02249956],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01005899,"threshold_uncertainty_score":0.0336507,"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."}}