{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:FSEGGE4TEHIGDIRJ2TYNYSWUU2","short_pith_number":"pith:FSEGGE4T","schema_version":"1.0","canonical_sha256":"2c8863139321d061a229d4f0dc4ad4a6bb791734d1d4278285f7d26f1a7ede57","source":{"kind":"arxiv","id":"1810.02227","version":1},"attestation_state":"computed","paper":{"title":"Randen - fast backtracking-resistant random generator with AES+Feistel+Reverie","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CR","authors_text":"Emmanuel Mogenet, Jan Wassenberg, Jyrki Alakuijala, Robert Obryk","submitted_at":"2018-10-04T14:08:57Z","abstract_excerpt":"Algorithms that rely on a pseudorandom number generator often lose their performance guarantees when adversaries can predict the behavior of the generator. To protect non-cryptographic applications against such attacks, we propose 'strong' pseudorandom generators characterized by two properties: computationally indistinguishable from random and backtracking-resistant. Some existing cryptographically secure generators also meet these criteria, but they are too slow to be accepted for general-purpose use. We introduce a new open-sourced generator called 'Randen' and show that it is 'strong' in a"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1810.02227","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-10-04T14:08:57Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ac9c45e00c3ca084f52a3bbdd4fc1a8fdf6db0600f4492a48fda9cfd67dcf32b","abstract_canon_sha256":"1bc6178cb58cdbe1ae043dc137c5a65187f5b1c6fa232fd0fd91ebac91f7078f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:05.875290Z","signature_b64":"H8PSoOo9uF+9R4diNBHzKQvAaS5lmtcVRYn9FmWFlvn1q4FKtg/6WYCIMTSAxWFJhcJpeVtco6x7KIuEg0wqBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c8863139321d061a229d4f0dc4ad4a6bb791734d1d4278285f7d26f1a7ede57","last_reissued_at":"2026-05-18T00:04:05.874539Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:05.874539Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Randen - fast backtracking-resistant random generator with AES+Feistel+Reverie","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CR","authors_text":"Emmanuel Mogenet, Jan Wassenberg, Jyrki Alakuijala, Robert Obryk","submitted_at":"2018-10-04T14:08:57Z","abstract_excerpt":"Algorithms that rely on a pseudorandom number generator often lose their performance guarantees when adversaries can predict the behavior of the generator. To protect non-cryptographic applications against such attacks, we propose 'strong' pseudorandom generators characterized by two properties: computationally indistinguishable from random and backtracking-resistant. Some existing cryptographically secure generators also meet these criteria, but they are too slow to be accepted for general-purpose use. We introduce a new open-sourced generator called 'Randen' and show that it is 'strong' in a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.02227","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1810.02227","created_at":"2026-05-18T00:04:05.874672+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.02227v1","created_at":"2026-05-18T00:04:05.874672+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.02227","created_at":"2026-05-18T00:04:05.874672+00:00"},{"alias_kind":"pith_short_12","alias_value":"FSEGGE4TEHIG","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"FSEGGE4TEHIGDIRJ","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"FSEGGE4T","created_at":"2026-05-18T12:32:25.280505+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FSEGGE4TEHIGDIRJ2TYNYSWUU2","json":"https://pith.science/pith/FSEGGE4TEHIGDIRJ2TYNYSWUU2.json","graph_json":"https://pith.science/api/pith-number/FSEGGE4TEHIGDIRJ2TYNYSWUU2/graph.json","events_json":"https://pith.science/api/pith-number/FSEGGE4TEHIGDIRJ2TYNYSWUU2/events.json","paper":"https://pith.science/paper/FSEGGE4T"},"agent_actions":{"view_html":"https://pith.science/pith/FSEGGE4TEHIGDIRJ2TYNYSWUU2","download_json":"https://pith.science/pith/FSEGGE4TEHIGDIRJ2TYNYSWUU2.json","view_paper":"https://pith.science/paper/FSEGGE4T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.02227&json=true","fetch_graph":"https://pith.science/api/pith-number/FSEGGE4TEHIGDIRJ2TYNYSWUU2/graph.json","fetch_events":"https://pith.science/api/pith-number/FSEGGE4TEHIGDIRJ2TYNYSWUU2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FSEGGE4TEHIGDIRJ2TYNYSWUU2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FSEGGE4TEHIGDIRJ2TYNYSWUU2/action/storage_attestation","attest_author":"https://pith.science/pith/FSEGGE4TEHIGDIRJ2TYNYSWUU2/action/author_attestation","sign_citation":"https://pith.science/pith/FSEGGE4TEHIGDIRJ2TYNYSWUU2/action/citation_signature","submit_replication":"https://pith.science/pith/FSEGGE4TEHIGDIRJ2TYNYSWUU2/action/replication_record"}},"created_at":"2026-05-18T00:04:05.874672+00:00","updated_at":"2026-05-18T00:04:05.874672+00:00"}