{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:4F2IXEAOUSWBPZUJYY44MA3EV5","short_pith_number":"pith:4F2IXEAO","schema_version":"1.0","canonical_sha256":"e1748b900ea4ac17e689c639c60364af6f3f5db0a2f25678c026bfe9d472cb41","source":{"kind":"arxiv","id":"2505.00894","version":3},"attestation_state":"computed","paper":{"title":"Non-Adaptive Cryptanalytic Time-Space Lower Bounds via a Shearer-like Inequality for Permutations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Avichai Marmor, Itai Dinur, Nathan Keller","submitted_at":"2025-05-01T22:17:11Z","abstract_excerpt":"The power of adaptivity in algorithms has been intensively studied in diverse areas of theoretical computer science. In this paper, we obtain a number of sharp lower bound results which show that adaptivity provides a significant extra power in cryptanalytic time-space tradeoffs with (possibly unlimited) preprocessing time.\n  Most notably, we consider the discrete logarithm (DLOG) problem in a generic group of $N$ elements. The classical `baby-step giant-step' algorithm for the problem has time complexity $T=O(\\sqrt{N})$, uses $O(\\sqrt{N})$ bits of space (up to logarithmic factors in $N$) and "},"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":"2505.00894","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2025-05-01T22:17:11Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"b43da1e16cd128b2d2199fbbb8c33928e3dbadac7c4bd35472205b94e5175cf9","abstract_canon_sha256":"9bbd6a6708cd422969a71755a49874bf42c2f5afc2c5cbccc46bcf8065e0ac18"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T01:05:05.798508Z","signature_b64":"QiaotHMiiNmACKSh/mVwJEyWpDfwVQEIOCzQO2ZtsIYukexclaIbp0WgYqRcokXGESw+bXIs0DXN94vuSaTCCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1748b900ea4ac17e689c639c60364af6f3f5db0a2f25678c026bfe9d472cb41","last_reissued_at":"2026-05-21T01:05:05.797475Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T01:05:05.797475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-Adaptive Cryptanalytic Time-Space Lower Bounds via a Shearer-like Inequality for Permutations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Avichai Marmor, Itai Dinur, Nathan Keller","submitted_at":"2025-05-01T22:17:11Z","abstract_excerpt":"The power of adaptivity in algorithms has been intensively studied in diverse areas of theoretical computer science. In this paper, we obtain a number of sharp lower bound results which show that adaptivity provides a significant extra power in cryptanalytic time-space tradeoffs with (possibly unlimited) preprocessing time.\n  Most notably, we consider the discrete logarithm (DLOG) problem in a generic group of $N$ elements. The classical `baby-step giant-step' algorithm for the problem has time complexity $T=O(\\sqrt{N})$, uses $O(\\sqrt{N})$ bits of space (up to logarithmic factors in $N$) and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.00894","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/2505.00894/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":"2505.00894","created_at":"2026-05-21T01:05:05.797606+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.00894v3","created_at":"2026-05-21T01:05:05.797606+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.00894","created_at":"2026-05-21T01:05:05.797606+00:00"},{"alias_kind":"pith_short_12","alias_value":"4F2IXEAOUSWB","created_at":"2026-05-21T01:05:05.797606+00:00"},{"alias_kind":"pith_short_16","alias_value":"4F2IXEAOUSWBPZUJ","created_at":"2026-05-21T01:05:05.797606+00:00"},{"alias_kind":"pith_short_8","alias_value":"4F2IXEAO","created_at":"2026-05-21T01:05:05.797606+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/4F2IXEAOUSWBPZUJYY44MA3EV5","json":"https://pith.science/pith/4F2IXEAOUSWBPZUJYY44MA3EV5.json","graph_json":"https://pith.science/api/pith-number/4F2IXEAOUSWBPZUJYY44MA3EV5/graph.json","events_json":"https://pith.science/api/pith-number/4F2IXEAOUSWBPZUJYY44MA3EV5/events.json","paper":"https://pith.science/paper/4F2IXEAO"},"agent_actions":{"view_html":"https://pith.science/pith/4F2IXEAOUSWBPZUJYY44MA3EV5","download_json":"https://pith.science/pith/4F2IXEAOUSWBPZUJYY44MA3EV5.json","view_paper":"https://pith.science/paper/4F2IXEAO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.00894&json=true","fetch_graph":"https://pith.science/api/pith-number/4F2IXEAOUSWBPZUJYY44MA3EV5/graph.json","fetch_events":"https://pith.science/api/pith-number/4F2IXEAOUSWBPZUJYY44MA3EV5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4F2IXEAOUSWBPZUJYY44MA3EV5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4F2IXEAOUSWBPZUJYY44MA3EV5/action/storage_attestation","attest_author":"https://pith.science/pith/4F2IXEAOUSWBPZUJYY44MA3EV5/action/author_attestation","sign_citation":"https://pith.science/pith/4F2IXEAOUSWBPZUJYY44MA3EV5/action/citation_signature","submit_replication":"https://pith.science/pith/4F2IXEAOUSWBPZUJYY44MA3EV5/action/replication_record"}},"created_at":"2026-05-21T01:05:05.797606+00:00","updated_at":"2026-05-21T01:05:05.797606+00:00"}