{"id":"W1999613060","doi":"10.1007/s13389-011-0017-8","title":"Speeding scalar multiplication over binary elliptic curves using the new carry-less multiplication instruction","year":2011,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Consejo Nacional de Ciencia y Tecnología; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; University of Waterloo; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Scalar multiplication; Elliptic curve cryptography; Edwards curve; Arithmetic; Elliptic curve; Elliptic curve point multiplication; Parallel computing; Computer science; Binary number; Side channel attack; Multiplication (music); Curve25519; Mathematics; Cryptography; Algorithm; Public-key cryptography; Encryption; Pure mathematics","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003667407,0.0007677653,0.0004595792,0.00146469,0.0004040774,0.0009757952,0.0007966347,0.0003726146,0.005519629],"category_scores_gemma":[0.001155919,0.0002699575,0.0002785988,0.001087537,0.0003934947,0.002295918,0.0006901254,0.0007073649,0.001466285],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004734286,"about_ca_system_score_gemma":0.000911105,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008554213,"about_ca_topic_score_gemma":0.001840907,"domain_scores_codex":[0.9995824,0.00003777688,0.00003802622,0.00006825796,0.0002036708,0.00007000164],"domain_scores_gemma":[0.9993415,0.0001892281,0.00006574906,0.0001524063,0.0002021852,0.0000489249],"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.001578318,0.0002894888,0.003097178,0.0004288778,0.00006392183,0.0003528764,0.0003047742,0.0115092,0.2130836,0.03493515,0.01354576,0.7208109],"study_design_scores_gemma":[0.0005381539,0.001564753,0.004283135,0.0001848691,0.000314541,0.001579074,0.000155889,0.3071738,0.5636077,0.03386491,0.0864924,0.0002407283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.5116808,0.003302988,0.4396459,0.0007858161,0.001548353,0.0002164945,0.000319881,0.01812836,0.02437148],"genre_scores_gemma":[0.7783548,0.0008600861,0.2021229,0.0003084203,0.0003666132,0.00007175862,0.0005426405,0.0004065871,0.01696611],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.005519629,"threshold_uncertainty_score":0.01846498,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02652695602035042,"score_gpt":0.2340954477578505,"score_spread":0.2075684917375001,"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."}}