{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004081156,0.0002543972,0.0003124481,0.0003055166,0.000642824,0.0002085137,0.0002379667,0.0001487338,0.000001291162],"category_scores_gemma":[0.000006490272,0.0002171158,0.0002231676,0.0003781339,0.0002200598,0.00004666323,0.000002136288,0.0001417602,7.355309e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001297132,"about_ca_system_score_gemma":0.00003753357,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009789639,"about_ca_topic_score_gemma":0.000007954694,"domain_scores_codex":[0.9984117,0.00009255992,0.0003046836,0.0006278576,0.0002114756,0.0003516987],"domain_scores_gemma":[0.9986777,0.0004469241,0.0001012284,0.0004209899,0.0001084949,0.0002446866],"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.00001408863,0.0002020522,0.000006719723,0.0005175567,0.0002340671,0.000001087067,0.001002812,0.01653345,0.005343295,0.0926151,0.00005156215,0.8834782],"study_design_scores_gemma":[0.005412584,0.001434086,0.000205542,0.0004135508,0.0003883494,0.0003472969,0.0008545231,0.870469,0.002128168,0.009214109,0.1076288,0.001504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001165515,0.0008614977,0.9950203,0.000307226,0.0003783119,0.001863825,0.0001116037,0.0001289153,0.0001628602],"genre_scores_gemma":[0.9662527,0.00006261199,0.03219696,0.0001292781,0.000108196,0.001159601,0.000005976341,0.00002898906,0.00005564058],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9650872,"threshold_uncertainty_score":0.8853727,"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."}}