{"id":"W1506026585","doi":"10.1023/a:1016549024113","title":"On the Security of the Digital Signature Algorithm","year":2002,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Ephemeral key; Key (lock); Key size; Computer science; Upper and lower bounds; Digital signature; Theoretical computer science; Lattice reduction; Mathematics; Discrete mathematics; Algorithm; Public-key cryptography; Computer security; Encryption; Computer network; Channel (broadcasting); Hash function","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.0002162125,0.0001914984,0.0001684616,0.0001119611,0.0003426293,0.0002872546,0.001062124,0.0000919165,0.0000429981],"category_scores_gemma":[0.00003281839,0.0001023435,0.0002587279,0.001148553,0.0003512545,0.0002854261,0.0002296846,0.0003043425,0.000004069637],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003170129,"about_ca_system_score_gemma":0.000007252676,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008030219,"about_ca_topic_score_gemma":0.000003048578,"domain_scores_codex":[0.9987404,0.0001080415,0.0001943704,0.0003398685,0.0003621575,0.0002551647],"domain_scores_gemma":[0.9985539,0.0003759645,0.0001088854,0.0008289295,0.00005490368,0.00007736521],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000005054101,0.0001882342,0.0006890596,0.00001091239,0.00004935967,0.000003205333,0.001032277,0.000002385842,0.0001103582,0.9525443,0.01003178,0.03533313],"study_design_scores_gemma":[0.0008018138,0.0005369643,0.006306219,0.0001211546,0.00004845824,0.00004237737,0.0003546203,0.02886317,0.003085129,0.9256269,0.03350898,0.000704226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1006104,0.004766011,0.8755456,0.003539218,0.0006160731,0.001003973,0.0005716481,0.0002793532,0.01306773],"genre_scores_gemma":[0.995077,0.0001761567,0.004049359,0.0006401869,0.00003160952,0.00001279999,0.000003061092,0.00000686866,0.000002958851],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8944666,"threshold_uncertainty_score":0.4173446,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01530928485841992,"score_gpt":0.1986974840301912,"score_spread":0.1833881991717713,"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."}}