{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:J6MI44P6S2QUPVD2G6MGXUBHHV","short_pith_number":"pith:J6MI44P6","schema_version":"1.0","canonical_sha256":"4f988e71fe96a147d47a37986bd0273d5d67e29ea3cee1e21ab7bba2323d842d","source":{"kind":"arxiv","id":"0912.1918","version":3},"attestation_state":"computed","paper":{"title":"Optimal quantitative cryptanalysis of permutation-only multimedia ciphers against plaintext attacks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Chengqing Li, Kwok-Tung Lo","submitted_at":"2009-12-10T06:05:57Z","abstract_excerpt":"Recently, an image scrambling encryption algorithm of pixel bit based on chaos map was proposed. Considering the algorithm as a typical binary image scrambling/permutation algorithm exerting on plaintext of size $M\\times (8N)$, this paper proposes a novel optimal method to break it with some known/chosen-plaintexts. The spatial complexity and computational complexity of the attack are only $O(32\\cdot MN)$ and $O(16\\cdot n_0\\cdot MN)$ respectively, where $n_0$ is the number of known/chosen-plaintexts used. The method can be easily extended to break any permutation-only encryption scheme exertin"},"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":"0912.1918","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2009-12-10T06:05:57Z","cross_cats_sorted":[],"title_canon_sha256":"fbe57feea971ff9b542d69eab0f7f99aae129ba7bd17de3d96ce2a6943b61b2e","abstract_canon_sha256":"338cc1a0b8789f431fd018aec0f0fd86f33ebc9e1a9c08f9bae4cfec4fa643f7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:09.728443Z","signature_b64":"DyO7IjwkuztDwDYPqUrml6tM23AshbKCwffYOAsxxL9lDM6zCTtM5RsOmIpOFQARW/i4g0O6znaKRv+5aTOOAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f988e71fe96a147d47a37986bd0273d5d67e29ea3cee1e21ab7bba2323d842d","last_reissued_at":"2026-05-18T01:04:09.727825Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:09.727825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal quantitative cryptanalysis of permutation-only multimedia ciphers against plaintext attacks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Chengqing Li, Kwok-Tung Lo","submitted_at":"2009-12-10T06:05:57Z","abstract_excerpt":"Recently, an image scrambling encryption algorithm of pixel bit based on chaos map was proposed. Considering the algorithm as a typical binary image scrambling/permutation algorithm exerting on plaintext of size $M\\times (8N)$, this paper proposes a novel optimal method to break it with some known/chosen-plaintexts. The spatial complexity and computational complexity of the attack are only $O(32\\cdot MN)$ and $O(16\\cdot n_0\\cdot MN)$ respectively, where $n_0$ is the number of known/chosen-plaintexts used. The method can be easily extended to break any permutation-only encryption scheme exertin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0912.1918","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":""},"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":"0912.1918","created_at":"2026-05-18T01:04:09.727920+00:00"},{"alias_kind":"arxiv_version","alias_value":"0912.1918v3","created_at":"2026-05-18T01:04:09.727920+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0912.1918","created_at":"2026-05-18T01:04:09.727920+00:00"},{"alias_kind":"pith_short_12","alias_value":"J6MI44P6S2QU","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_16","alias_value":"J6MI44P6S2QUPVD2","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_8","alias_value":"J6MI44P6","created_at":"2026-05-18T12:26:00.592388+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/J6MI44P6S2QUPVD2G6MGXUBHHV","json":"https://pith.science/pith/J6MI44P6S2QUPVD2G6MGXUBHHV.json","graph_json":"https://pith.science/api/pith-number/J6MI44P6S2QUPVD2G6MGXUBHHV/graph.json","events_json":"https://pith.science/api/pith-number/J6MI44P6S2QUPVD2G6MGXUBHHV/events.json","paper":"https://pith.science/paper/J6MI44P6"},"agent_actions":{"view_html":"https://pith.science/pith/J6MI44P6S2QUPVD2G6MGXUBHHV","download_json":"https://pith.science/pith/J6MI44P6S2QUPVD2G6MGXUBHHV.json","view_paper":"https://pith.science/paper/J6MI44P6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0912.1918&json=true","fetch_graph":"https://pith.science/api/pith-number/J6MI44P6S2QUPVD2G6MGXUBHHV/graph.json","fetch_events":"https://pith.science/api/pith-number/J6MI44P6S2QUPVD2G6MGXUBHHV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J6MI44P6S2QUPVD2G6MGXUBHHV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J6MI44P6S2QUPVD2G6MGXUBHHV/action/storage_attestation","attest_author":"https://pith.science/pith/J6MI44P6S2QUPVD2G6MGXUBHHV/action/author_attestation","sign_citation":"https://pith.science/pith/J6MI44P6S2QUPVD2G6MGXUBHHV/action/citation_signature","submit_replication":"https://pith.science/pith/J6MI44P6S2QUPVD2G6MGXUBHHV/action/replication_record"}},"created_at":"2026-05-18T01:04:09.727920+00:00","updated_at":"2026-05-18T01:04:09.727920+00:00"}