{"id":"W1978602192","doi":"10.1109/tcsi.2013.2283691","title":"Efficient algorithm and architecture for elliptic curve cryptography for extremely constrained secure applications","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems I Regular Papers","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":107,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Division of Electrical, Communications and Cyber Systems","keywords":"Computer science; Elliptic curve cryptography; Application-specific integrated circuit; Cryptography; Multiplier (economics); Edwards curve; Elliptic curve; Affine transformation; Multiplication (music); Algorithm; Arithmetic; Theoretical computer science; Computer hardware; Encryption; Mathematics; Public-key cryptography","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.0002353078,0.0004383689,0.0003375619,0.0007455095,0.000364939,0.0005711752,0.0008055629,0.0003956663,0.002373494],"category_scores_gemma":[0.000449136,0.0001890248,0.000271443,0.0009198074,0.0003611173,0.001217635,0.0006212046,0.0005406417,0.00167943],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005036269,"about_ca_system_score_gemma":0.0008476122,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004773244,"about_ca_topic_score_gemma":0.0007326416,"domain_scores_codex":[0.9997256,0.00004393872,0.0000213757,0.00003480941,0.0001432923,0.00003098169],"domain_scores_gemma":[0.9998448,0.00001837028,0.00002161685,0.00005094419,0.00005535475,0.000008953882],"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.0004194278,0.0001647069,0.001250049,0.0003876717,0.00007267656,0.0002993875,0.0002142611,0.05732663,0.3041845,0.1227483,0.005921766,0.5070106],"study_design_scores_gemma":[0.0002294228,0.0008683985,0.002030757,0.0001196579,0.00009593087,0.001370011,0.0001477258,0.5954638,0.2528358,0.05468912,0.09205081,0.00009859317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04472726,0.001226035,0.9448849,0.0002490337,0.00006511604,0.0001574948,0.0000646778,0.001246313,0.007379178],"genre_scores_gemma":[0.3596253,0.001233178,0.6307254,0.0001062721,0.00006022936,0.0002101522,0.0003741551,0.00008996325,0.007575351],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002373494,"threshold_uncertainty_score":0.007940114,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009798990862371267,"score_gpt":0.2117982830050289,"score_spread":0.2019992921426577,"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."}}