{"id":"W2953289753","doi":"10.1109/tvlsi.2019.2922999","title":"Optimized Schoolbook Polynomial Multiplication for Compact Lattice-Based Cryptography on FPGA","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":135,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Fundamental Research Funds for the Central Universities; Government of Jiangsu Province; Six Talent Peaks Project in Jiangsu Province; Queen's University; National Natural Science Foundation of China; Queen's University Belfast","keywords":"Field-programmable gate array; Computer science; Lattice-based cryptography; Speedup; Cryptography; Multiplication (music); Throughput; Parallel computing; Computer hardware; Algorithm; Mathematics; Quantum; Quantum cryptography; Physics; Quantum information","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001466146,0.0004601383,0.000361183,0.0003761336,0.0003127237,0.0006458557,0.0005922249,0.0002426142,0.004755035],"category_scores_gemma":[0.0003270105,0.0001546843,0.0002394854,0.0005290391,0.0002207663,0.000727903,0.0003123537,0.0004081828,0.00145044],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005995958,"about_ca_system_score_gemma":0.0008221955,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006748748,"about_ca_topic_score_gemma":0.001635376,"domain_scores_codex":[0.999803,0.00003419495,0.00001212903,0.00002429808,0.00008763152,0.00003871168],"domain_scores_gemma":[0.9998405,0.00003583663,0.00002878107,0.00004064529,0.00003912997,0.00001518882],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001288176,0.0002361517,0.001660201,0.0006719924,0.000103816,0.0005959194,0.0001356543,0.07559013,0.4353988,0.06505444,0.01560892,0.4036557],"study_design_scores_gemma":[0.00041566,0.002443718,0.002350302,0.0001124678,0.0001275038,0.001974114,0.0001184579,0.4794904,0.4053343,0.01207799,0.09543236,0.0001227698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2889356,0.00197797,0.6603856,0.0004823558,0.0002569727,0.000316698,0.0004596578,0.004979278,0.04220583],"genre_scores_gemma":[0.675435,0.0004771183,0.3159652,0.000122442,0.00005611275,0.0001273407,0.0003949579,0.0001136113,0.007308192],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004755035,"threshold_uncertainty_score":0.01590723,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01530187227589272,"score_gpt":0.2526773690943855,"score_spread":0.2373754968184928,"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."}}