{"id":"W2123577276","doi":"10.1287/ijoc.1070.0251","title":"Efficient Jump Ahead for 𝔽<sub>2</sub>-Linear Random Number Generators","year":2008,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":79,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal","funders":"Japan Society for the Promotion of Science","keywords":"Modulo; Mathematics; Matrix multiplication; Pseudorandom number generator; Jump; Time complexity; Disjoint sets; Discrete mathematics; Random number generation; Matrix (chemical analysis); Multiplication (music); Sequence (biology); State (computer science); Combinatorics; Algorithm; Iterated 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.000620054,0.0004679836,0.0005746958,0.000653829,0.0005599796,0.0007230962,0.0008100584,0.0005114421,0.00763553],"category_scores_gemma":[0.002380519,0.000311106,0.0003735297,0.000492139,0.0005076157,0.001476961,0.001044731,0.0007900172,0.001660054],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006643659,"about_ca_system_score_gemma":0.0007264394,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008168649,"about_ca_topic_score_gemma":0.001855713,"domain_scores_codex":[0.9994566,0.00009861586,0.00004451901,0.00008924464,0.0002084944,0.0001025355],"domain_scores_gemma":[0.9988858,0.0006762177,0.0001199977,0.0001605295,0.0001087943,0.00004862046],"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.00158332,0.0002302603,0.001545792,0.0003666201,0.00004637985,0.0007612801,0.0005436819,0.09671807,0.08607727,0.1628575,0.009934297,0.6393356],"study_design_scores_gemma":[0.0001866238,0.0003347553,0.0004619157,0.00003579065,0.00002209979,0.0003592846,0.00006277869,0.8719975,0.06118175,0.05815159,0.007150207,0.00005580516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1172821,0.000302336,0.8708375,0.0002413046,0.00009465668,0.0002116782,0.0001521039,0.005715188,0.005163284],"genre_scores_gemma":[0.5755509,0.0001374924,0.41437,0.0001028117,0.00004340215,0.0001815279,0.0003460262,0.0003261805,0.008941576],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00763553,"threshold_uncertainty_score":0.02554339,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02100252490413513,"score_gpt":0.2610842207849916,"score_spread":0.2400816958808565,"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."}}