{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:2HV6TUJFURGNQC7IHT366HVTGS","short_pith_number":"pith:2HV6TUJF","schema_version":"1.0","canonical_sha256":"d1ebe9d125a44cd80be83cf7ef1eb3349664dddd337ac17ae003d058c9ae583f","source":{"kind":"arxiv","id":"1508.00462","version":1},"attestation_state":"computed","paper":{"title":"Distinguishing a truncated random permutation from a random function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Shay Gueron, Shoni Gilboa","submitted_at":"2015-07-29T18:31:39Z","abstract_excerpt":"An oracle chooses a function $f$ from the set of $n$ bits strings to itself, which is either a randomly chosen permutation or a randomly chosen function. When queried by an $n$-bit string $w$, the oracle computes $f(w)$, truncates the $m$ last bits, and returns only the first $n-m$ bits of $f(w)$. How many queries does a querying adversary need to submit in order to distinguish the truncated permutation from a random function?\n  In 1998, Hall et al. showed an algorithm for determining (with high probability) whether or not $f$ is a permutation, using $O(2^{\\frac{m+n}{2}})$ queries. They also s"},"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":"1508.00462","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-07-29T18:31:39Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"194f4bdcc2a7c501f545ebcc97ecc44dba2f941aaf7e595c95928f4645c336c3","abstract_canon_sha256":"c174c2e212f8ed2f951b2b4fd6c1b453d1f23891a16736f5502cdda45532c1dd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:58.049961Z","signature_b64":"aQn8uINIa9JZFoD6JSymMmqlT5LpoyizpIqtgQdr0Twipv+zHrjn+M4vdA/EHMtg/PP0jeWOQGvFoCNFE30/Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1ebe9d125a44cd80be83cf7ef1eb3349664dddd337ac17ae003d058c9ae583f","last_reissued_at":"2026-05-18T01:35:58.049281Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:58.049281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distinguishing a truncated random permutation from a random function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Shay Gueron, Shoni Gilboa","submitted_at":"2015-07-29T18:31:39Z","abstract_excerpt":"An oracle chooses a function $f$ from the set of $n$ bits strings to itself, which is either a randomly chosen permutation or a randomly chosen function. When queried by an $n$-bit string $w$, the oracle computes $f(w)$, truncates the $m$ last bits, and returns only the first $n-m$ bits of $f(w)$. How many queries does a querying adversary need to submit in order to distinguish the truncated permutation from a random function?\n  In 1998, Hall et al. showed an algorithm for determining (with high probability) whether or not $f$ is a permutation, using $O(2^{\\frac{m+n}{2}})$ queries. They also s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.00462","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":"1508.00462","created_at":"2026-05-18T01:35:58.049387+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.00462v1","created_at":"2026-05-18T01:35:58.049387+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.00462","created_at":"2026-05-18T01:35:58.049387+00:00"},{"alias_kind":"pith_short_12","alias_value":"2HV6TUJFURGN","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"2HV6TUJFURGNQC7I","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"2HV6TUJF","created_at":"2026-05-18T12:28:59.999130+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/2HV6TUJFURGNQC7IHT366HVTGS","json":"https://pith.science/pith/2HV6TUJFURGNQC7IHT366HVTGS.json","graph_json":"https://pith.science/api/pith-number/2HV6TUJFURGNQC7IHT366HVTGS/graph.json","events_json":"https://pith.science/api/pith-number/2HV6TUJFURGNQC7IHT366HVTGS/events.json","paper":"https://pith.science/paper/2HV6TUJF"},"agent_actions":{"view_html":"https://pith.science/pith/2HV6TUJFURGNQC7IHT366HVTGS","download_json":"https://pith.science/pith/2HV6TUJFURGNQC7IHT366HVTGS.json","view_paper":"https://pith.science/paper/2HV6TUJF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.00462&json=true","fetch_graph":"https://pith.science/api/pith-number/2HV6TUJFURGNQC7IHT366HVTGS/graph.json","fetch_events":"https://pith.science/api/pith-number/2HV6TUJFURGNQC7IHT366HVTGS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2HV6TUJFURGNQC7IHT366HVTGS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2HV6TUJFURGNQC7IHT366HVTGS/action/storage_attestation","attest_author":"https://pith.science/pith/2HV6TUJFURGNQC7IHT366HVTGS/action/author_attestation","sign_citation":"https://pith.science/pith/2HV6TUJFURGNQC7IHT366HVTGS/action/citation_signature","submit_replication":"https://pith.science/pith/2HV6TUJFURGNQC7IHT366HVTGS/action/replication_record"}},"created_at":"2026-05-18T01:35:58.049387+00:00","updated_at":"2026-05-18T01:35:58.049387+00:00"}