{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001905038,0.0003277917,0.0002924727,0.0004703308,0.0002092836,0.0004464441,0.0005258414,0.0001974177,0.004058588],"category_scores_gemma":[0.0006387286,0.0001162361,0.0002565149,0.0003371689,0.0001741218,0.0004683457,0.0001728922,0.000272828,0.0009006818],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002680874,"about_ca_system_score_gemma":0.000358265,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004916865,"about_ca_topic_score_gemma":0.0006061858,"domain_scores_codex":[0.9998643,0.00001834739,0.00001479838,0.00001858933,0.00006336701,0.00002055698],"domain_scores_gemma":[0.9998003,0.00006529143,0.00001996425,0.00004934843,0.00005489131,0.00001019801],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008891331,0.0001582875,0.003336933,0.0005684209,0.00008481914,0.0007798548,0.0002629647,0.03845102,0.294215,0.05643646,0.007290342,0.5975268],"study_design_scores_gemma":[0.0002590156,0.001060266,0.003909853,0.00009397673,0.0001163966,0.001713992,0.00006520152,0.4413885,0.492623,0.01079409,0.04791582,0.00005991376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1573874,0.0006196492,0.8137252,0.0001788612,0.0002691455,0.0001617074,0.0002261287,0.007601904,0.01983004],"genre_scores_gemma":[0.7419017,0.0001765748,0.2535697,0.00004459731,0.00005207062,0.00005948409,0.0002581771,0.0001034243,0.0038343],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004058588,"threshold_uncertainty_score":0.01357734,"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."}}