{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:OAVZBSNB3OEESPMCOB5IEEUGSB","short_pith_number":"pith:OAVZBSNB","schema_version":"1.0","canonical_sha256":"702b90c9a1db88493d82707a821286907cfb49c1c0434520582fe7b0330df3d7","source":{"kind":"arxiv","id":"1909.04750","version":3},"attestation_state":"computed","paper":{"title":"Generating High Quality Random Numbers: A High Throughput Parallel Bitsliced Approach","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Dara Rahmati, Mohammadsina Kiarostami, Omid Hajihassani, Saeid Gorgin, Saleh Khalaj Monfared, Soroush Meghdadi Zanjani","submitted_at":"2019-09-10T20:51:02Z","abstract_excerpt":"In this work, by employing a bitsliced data representation as building blocks of algorithms, we showcase the capability and scalability of our proposed method in a variety of PRNG methods in the category of block and stream ciphers. While demonstrating the suitability of stream-ciphers for high throughput PRNG, as an example, we implement and investigate a bitsliced MICKEY 2.0 PRNG by altering the paradigm of internal functions and data structure. The LFSR-based (Linear Feedback Shift Register) nature of the PRNG in our implementation perfectly suits the GPU's many-core structure due to its re"},"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":"1909.04750","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CR","submitted_at":"2019-09-10T20:51:02Z","cross_cats_sorted":[],"title_canon_sha256":"1b2948dd349da08f780304667f65caa1c1c4614797001a00b9c89d3c209cb80d","abstract_canon_sha256":"48ef3d57d6b99e5aebf3aa8a38a96024644e64e419b08c20eac9c010fecbeee8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:13:16.405967Z","signature_b64":"SSyyZbS0dLgpzA4eQ3YkkKBJKqDlwx8llljF4UU84/CxDRzzVNJLBQvM5jLzghATidsiBmWpMY36d9vE9nHmDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"702b90c9a1db88493d82707a821286907cfb49c1c0434520582fe7b0330df3d7","last_reissued_at":"2026-07-05T00:13:16.405556Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:13:16.405556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generating High Quality Random Numbers: A High Throughput Parallel Bitsliced Approach","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Dara Rahmati, Mohammadsina Kiarostami, Omid Hajihassani, Saeid Gorgin, Saleh Khalaj Monfared, Soroush Meghdadi Zanjani","submitted_at":"2019-09-10T20:51:02Z","abstract_excerpt":"In this work, by employing a bitsliced data representation as building blocks of algorithms, we showcase the capability and scalability of our proposed method in a variety of PRNG methods in the category of block and stream ciphers. While demonstrating the suitability of stream-ciphers for high throughput PRNG, as an example, we implement and investigate a bitsliced MICKEY 2.0 PRNG by altering the paradigm of internal functions and data structure. The LFSR-based (Linear Feedback Shift Register) nature of the PRNG in our implementation perfectly suits the GPU's many-core structure due to its re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.04750","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1909.04750/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1909.04750","created_at":"2026-07-05T00:13:16.405611+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.04750v3","created_at":"2026-07-05T00:13:16.405611+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.04750","created_at":"2026-07-05T00:13:16.405611+00:00"},{"alias_kind":"pith_short_12","alias_value":"OAVZBSNB3OEE","created_at":"2026-07-05T00:13:16.405611+00:00"},{"alias_kind":"pith_short_16","alias_value":"OAVZBSNB3OEESPMC","created_at":"2026-07-05T00:13:16.405611+00:00"},{"alias_kind":"pith_short_8","alias_value":"OAVZBSNB","created_at":"2026-07-05T00:13:16.405611+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/OAVZBSNB3OEESPMCOB5IEEUGSB","json":"https://pith.science/pith/OAVZBSNB3OEESPMCOB5IEEUGSB.json","graph_json":"https://pith.science/api/pith-number/OAVZBSNB3OEESPMCOB5IEEUGSB/graph.json","events_json":"https://pith.science/api/pith-number/OAVZBSNB3OEESPMCOB5IEEUGSB/events.json","paper":"https://pith.science/paper/OAVZBSNB"},"agent_actions":{"view_html":"https://pith.science/pith/OAVZBSNB3OEESPMCOB5IEEUGSB","download_json":"https://pith.science/pith/OAVZBSNB3OEESPMCOB5IEEUGSB.json","view_paper":"https://pith.science/paper/OAVZBSNB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.04750&json=true","fetch_graph":"https://pith.science/api/pith-number/OAVZBSNB3OEESPMCOB5IEEUGSB/graph.json","fetch_events":"https://pith.science/api/pith-number/OAVZBSNB3OEESPMCOB5IEEUGSB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OAVZBSNB3OEESPMCOB5IEEUGSB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OAVZBSNB3OEESPMCOB5IEEUGSB/action/storage_attestation","attest_author":"https://pith.science/pith/OAVZBSNB3OEESPMCOB5IEEUGSB/action/author_attestation","sign_citation":"https://pith.science/pith/OAVZBSNB3OEESPMCOB5IEEUGSB/action/citation_signature","submit_replication":"https://pith.science/pith/OAVZBSNB3OEESPMCOB5IEEUGSB/action/replication_record"}},"created_at":"2026-07-05T00:13:16.405611+00:00","updated_at":"2026-07-05T00:13:16.405611+00:00"}