{"id":"W2125116885","doi":"10.1109/newcas.2005.1496674","title":"Hardware Implementation of Large Number-Multiplication by FFT with Modular Arithmetic","year":2005,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal","funders":"","keywords":"Operand; Modular arithmetic; Fast Fourier transform; Multiplication (music); Arithmetic; Computer science; Multiplication algorithm; Cryptosystem; Parallel computing; Scalability; Field-programmable gate array; Elliptic curve; Public-key cryptography; Modular design; Cryptography; Algorithm; Mathematics; Computer hardware; Encryption; Binary number","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.0001453601,0.0001001969,0.0001109594,0.0000704718,0.00007930029,0.00004505925,0.0003350911,0.00003516511,0.0001036718],"category_scores_gemma":[0.000002910287,0.00007789277,0.00004797626,0.0004180665,0.00002886321,0.0003823652,0.00006359201,0.00005597308,0.00002991121],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001618733,"about_ca_system_score_gemma":0.00002607584,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000120762,"about_ca_topic_score_gemma":0.0001214939,"domain_scores_codex":[0.999042,0.000031619,0.0002037125,0.0002658548,0.0002535571,0.0002032607],"domain_scores_gemma":[0.999337,0.0000270058,0.00009236472,0.0003875082,0.00009806933,0.00005812129],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00003611583,0.001562743,0.1539117,0.0001487822,0.0002933409,0.000007041528,0.00468649,0.0005311269,0.06241545,0.3788627,0.01484824,0.3826962],"study_design_scores_gemma":[0.00767369,0.0006478408,0.2328658,0.00007964965,0.000107781,0.00008215355,0.001526063,0.1671172,0.50817,0.004606253,0.07581809,0.001305449],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1540923,0.00008263429,0.8433905,0.001329446,0.00002422834,0.0002178262,0.00001226914,0.0001003326,0.0007504566],"genre_scores_gemma":[0.8633963,0.00001655584,0.136264,0.00017289,0.00001696727,0.00002038257,0.00001522872,0.000005896428,0.00009178519],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.709304,"threshold_uncertainty_score":0.3176375,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005025800593118179,"score_gpt":0.2625555474473782,"score_spread":0.25752974685426,"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."}}