{"id":"W1578863054","doi":"10.1007/3-540-39568-7_38","title":"Sequence Complexity as a Test for Cryptographic Systems","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"ca_institutions":"Queen's University","funders":"","keywords":"Plaintext; Ciphertext; Mathematics; Computational complexity theory; Algorithm; Encryption; Cryptography; Sequence (biology); Theoretical computer science; Computer science","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.003738722,0.0007721294,0.0009803828,0.004715264,0.001553908,0.003877901,0.001552249,0.002683121,0.008186485],"category_scores_gemma":[0.03089102,0.0004527054,0.001112634,0.002039201,0.007472909,0.01242278,0.003934364,0.004326627,0.0009872664],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002030421,"about_ca_system_score_gemma":0.001325099,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004470516,"about_ca_topic_score_gemma":0.0002444439,"domain_scores_codex":[0.9950445,0.001789172,0.0002696338,0.0005685226,0.001879892,0.0004483025],"domain_scores_gemma":[0.9430575,0.04718626,0.002133941,0.003569347,0.00231549,0.001737328],"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.0002317931,0.00006345737,0.001749817,0.00008398169,0.00002260421,0.00008406647,0.0001529281,0.006920533,0.002132737,0.970679,0.001992546,0.01588647],"study_design_scores_gemma":[0.00003920986,0.000157684,0.0007329321,0.00003399037,0.00001586075,0.0001858804,0.00007902222,0.06092348,0.00387864,0.9316327,0.002286251,0.00003433952],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.4312489,0.0009863238,0.4512576,0.004315117,0.0005448229,0.0002687367,0.0008760732,0.001156331,0.109346],"genre_scores_gemma":[0.9674746,0.0002412023,0.02507851,0.0002860846,0.0003451313,0.0001948401,0.0005000325,0.0001171236,0.005762335],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008186485,"threshold_uncertainty_score":0.02738655,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07686619966551514,"score_gpt":0.3052293521594427,"score_spread":0.2283631524939276,"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."}}