{"id":"W2016433047","doi":"10.1007/s11265-009-0376-x","title":"Efficient FPGA Implementation of a Programmable Architecture for GF(p) Elliptic Curve Crypto Computations","year":2009,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"Jordan University of Science and Technology; Dalhousie University","keywords":"Elliptic curve cryptography; Elliptic curve point multiplication; Elliptic Curve Digital Signature Algorithm; Field-programmable gate array; Tripling-oriented Doche–Icart–Kohel curve; Computation; Computer science; Elliptic curve; Hessian form of an elliptic curve; Parallel computing; Multiplication (music); Cryptography; Prime (order theory); Arithmetic; Mathematics; Algorithm; Computer hardware; Public-key cryptography; Combinatorics; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007717722,0.0001375723,0.0003186591,0.0003608593,0.0001854182,0.0002631709,0.0004211043,0.00005089185,0.00000165995],"category_scores_gemma":[0.00001258547,0.0001046749,0.0001880818,0.0006018894,0.00004855544,0.0001517439,0.00001823235,0.0001531007,6.321608e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003673053,"about_ca_system_score_gemma":0.0002102796,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001190159,"about_ca_topic_score_gemma":0.000001309283,"domain_scores_codex":[0.9982248,0.0000825794,0.0007882417,0.0001708728,0.0004782479,0.0002552347],"domain_scores_gemma":[0.9980151,0.0001155024,0.000988289,0.000115625,0.0006668064,0.00009868134],"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.00007409157,0.0004816261,0.000226605,0.0008805442,0.0001093281,0.00001851158,0.004724529,0.4005443,0.006355906,0.004590919,0.0003153825,0.5816783],"study_design_scores_gemma":[0.007629556,0.008478723,0.008228683,0.004213995,0.0004177795,0.001702813,0.004664515,0.9083402,0.02119419,0.02919861,0.004787546,0.001143366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04127592,0.002200007,0.9553137,0.0005630493,0.0001737976,0.0004134349,0.000003086382,0.00002629921,0.00003073425],"genre_scores_gemma":[0.9399735,0.000003240159,0.05982262,0.0000331901,0.0001453967,0.000008066783,0.000001200804,0.000006906017,0.000005836739],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8986976,"threshold_uncertainty_score":0.4268517,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.014614736333983,"score_gpt":0.2884955644651681,"score_spread":0.2738808281311851,"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."}}