{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.003330278,0.001140013,0.001255609,0.001822043,0.0006446296,0.001450431,0.007677839,0.000693367,0.00001926137],"category_scores_gemma":[0.0006406025,0.001086029,0.0004329864,0.001826301,0.002645114,0.0008157956,0.002524784,0.001307894,0.00007704613],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008128556,"about_ca_system_score_gemma":0.001219102,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002153916,"about_ca_topic_score_gemma":0.0002348334,"domain_scores_codex":[0.9914474,0.00007178775,0.001280185,0.003507659,0.001993589,0.001699355],"domain_scores_gemma":[0.9909011,0.003689489,0.0006659286,0.003138722,0.001094572,0.0005102513],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002284598,0.0002509888,0.0003377575,0.0004285878,0.00004501944,0.0003672127,0.0007613761,0.03071897,0.0002720041,0.3732159,0.00005884291,0.5935205],"study_design_scores_gemma":[0.0003561385,0.0005594808,0.0001694538,0.0003518104,0.00001209941,0.000304303,2.964623e-7,0.5966408,0.0001698278,0.397675,0.002736753,0.001024088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00008598647,0.0008351425,0.9875272,0.0006445291,0.004513743,0.002092211,0.00004601173,0.0006216174,0.003633545],"genre_scores_gemma":[0.09015429,0.00004268335,0.9061559,0.001782789,0.001379391,0.00008208308,0.00001851767,0.00009556179,0.0002887639],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5924965,"threshold_uncertainty_score":0.9995862,"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."}}