{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002880189,0.00124882,0.001127866,0.00234198,0.001780277,0.003869707,0.001071821,0.003024873,0.006206134],"category_scores_gemma":[0.0112934,0.0005233901,0.0009272617,0.002701528,0.007009634,0.009024807,0.003815384,0.005376741,0.002096387],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001995527,"about_ca_system_score_gemma":0.001878051,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008287127,"about_ca_topic_score_gemma":0.0003680294,"domain_scores_codex":[0.99689,0.0009286228,0.0001870988,0.000453849,0.001081597,0.0004589451],"domain_scores_gemma":[0.9933509,0.004273199,0.0003781467,0.0009464573,0.0008767117,0.0001746259],"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.0001630484,0.00001879549,0.00009069809,0.00006136998,0.00001370539,0.00005814894,0.000117182,0.004943544,0.001072563,0.9718977,0.00221816,0.01934505],"study_design_scores_gemma":[0.00003360581,0.00003455044,0.00005893612,0.00005917057,0.00001056248,0.00008600068,0.00002918891,0.01491511,0.001140896,0.9740994,0.009509519,0.00002295493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0963765,0.01330945,0.6452289,0.01846692,0.0038905,0.000172544,0.0005541816,0.0003457218,0.2216552],"genre_scores_gemma":[0.812203,0.01543762,0.1150597,0.003145367,0.004532361,0.0002337667,0.0005761872,0.0002505615,0.04856152],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006206134,"threshold_uncertainty_score":0.02076155,"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."}}