{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002922779,0.0006218645,0.0003841621,0.0007626961,0.0004100595,0.0009942345,0.0007463163,0.000328382,0.008425788],"category_scores_gemma":[0.0006880016,0.0002402593,0.000249904,0.0007384507,0.0001971698,0.0009651575,0.0004314497,0.0004707751,0.00169684],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000568979,"about_ca_system_score_gemma":0.0006174092,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001205966,"about_ca_topic_score_gemma":0.002854643,"domain_scores_codex":[0.9995847,0.00008975732,0.00002634593,0.00003154254,0.0001799927,0.00008757322],"domain_scores_gemma":[0.9997223,0.00008817974,0.00002411031,0.00007746102,0.00007177096,0.00001622394],"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.001926563,0.0002494444,0.001760977,0.0005567931,0.0001215923,0.000548062,0.0001828127,0.07598452,0.1655731,0.05276857,0.01164868,0.6886788],"study_design_scores_gemma":[0.0005763117,0.001189797,0.003050423,0.0002026674,0.0001519963,0.00123868,0.0001637884,0.599234,0.3145979,0.01847475,0.06104327,0.00007641052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.4080128,0.00420907,0.5219796,0.0005345808,0.0005721421,0.0002605222,0.0003700942,0.004227715,0.05983345],"genre_scores_gemma":[0.8396068,0.00115858,0.14207,0.0001204984,0.00009766748,0.00008033754,0.0005661885,0.0001171955,0.01618268],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008425788,"threshold_uncertainty_score":0.0281871,"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."}}