{"id":"W2007733358","doi":"10.1016/j.compeleceng.2007.05.006","title":"On efficient implementation of FPGA-based hyperelliptic curve cryptosystems","year":2007,"lang":"en","type":"article","venue":"Computers & Electrical Engineering","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hyperelliptic curve cryptography; Hyperelliptic curve; Cryptosystem; Computer science; Field-programmable gate array; Field (mathematics); Arithmetic; Cryptography; Coordinate system; Exponentiation; Transformation (genetics); Representation (politics); Implementation; Finite field; Parallel computing; Theoretical computer science; Elliptic curve cryptography; Embedded system; Algorithm; Mathematics; Public-key cryptography; Encryption; Discrete mathematics; Pure mathematics; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":true,"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.0003798488,0.0001716684,0.0002228344,0.000517793,0.00005547948,0.00004558477,0.0004626107,0.00005977603,0.000002588896],"category_scores_gemma":[0.00002209023,0.0001618412,0.0001345159,0.001270763,0.00001606597,0.00005285993,0.00005017076,0.0001781555,0.000007030008],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007786089,"about_ca_system_score_gemma":0.00003991451,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000197544,"about_ca_topic_score_gemma":0.00000109888,"domain_scores_codex":[0.9984927,0.00002674595,0.0003697518,0.0003099149,0.0003607198,0.000440195],"domain_scores_gemma":[0.9988903,0.0005127849,0.00008662693,0.0003205742,0.00006006917,0.0001296264],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002297787,0.0002771019,0.0003735038,0.0001125466,0.00006896628,0.0000500166,0.0002916484,0.7391088,0.01354859,0.1355559,0.0001591757,0.1104308],"study_design_scores_gemma":[0.0005957682,0.000356337,0.005389703,0.00005348513,0.00000855186,0.000009113935,0.000004701765,0.9531417,0.03993571,0.0001154799,0.000173667,0.0002157784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2027587,0.0001458652,0.796324,0.00004473282,0.0003800213,0.0001582735,5.118227e-7,0.0001495201,0.00003837607],"genre_scores_gemma":[0.9672568,0.000001973844,0.03260097,0.00006783518,0.00005273543,0.000004716968,0.000001826733,0.00001224878,9.005388e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7644981,"threshold_uncertainty_score":0.6599692,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005632031987279896,"score_gpt":0.2261423301958869,"score_spread":0.220510298208607,"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."}}