{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:XNIA3GNXC6C74O4O2LVG3R3A2Z","short_pith_number":"pith:XNIA3GNX","canonical_record":{"source":{"id":"1505.00335","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2015-05-02T12:01:26Z","cross_cats_sorted":[],"title_canon_sha256":"40b6b07c558e8c987b0c9e21a4100b9b3006cd6f80072f317f99285c794c4181","abstract_canon_sha256":"a99b5f0f44c3d7a4e511a09176ad3ffdc83b598bfa9cf376cfd4d9019c854606"},"schema_version":"1.0"},"canonical_sha256":"bb500d99b71785fe3b8ed2ea6dc760d670fc402a8dfd7df101e4b312caa9519b","source":{"kind":"arxiv","id":"1505.00335","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.00335","created_at":"2026-05-18T01:04:00Z"},{"alias_kind":"arxiv_version","alias_value":"1505.00335v2","created_at":"2026-05-18T01:04:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.00335","created_at":"2026-05-18T01:04:00Z"},{"alias_kind":"pith_short_12","alias_value":"XNIA3GNXC6C7","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XNIA3GNXC6C74O4O","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XNIA3GNX","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:XNIA3GNXC6C74O4O2LVG3R3A2Z","target":"record","payload":{"canonical_record":{"source":{"id":"1505.00335","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2015-05-02T12:01:26Z","cross_cats_sorted":[],"title_canon_sha256":"40b6b07c558e8c987b0c9e21a4100b9b3006cd6f80072f317f99285c794c4181","abstract_canon_sha256":"a99b5f0f44c3d7a4e511a09176ad3ffdc83b598bfa9cf376cfd4d9019c854606"},"schema_version":"1.0"},"canonical_sha256":"bb500d99b71785fe3b8ed2ea6dc760d670fc402a8dfd7df101e4b312caa9519b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:00.326923Z","signature_b64":"YZvCdl3CS25H5cxv41ccHu8KdwjjAvbWMw/GXsU6jBq72wmbsWyhQh+5dMPEeow8yi7LeteBneMG4n1YO0hSBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb500d99b71785fe3b8ed2ea6dc760d670fc402a8dfd7df101e4b312caa9519b","last_reissued_at":"2026-05-18T01:04:00.326376Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:00.326376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.00335","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:04:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Zdzketyektvp4/hbCTSiK3zw1avyczDg/aNKrfgpBP3gndHJ7PlZhh9NTuDeXbyvEkIH2xCzwC2sxAIeeeZAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:38:24.316198Z"},"content_sha256":"8c9dfb43761732e85cac1da4cb8cb60bcafc2453723054b95c5667c21de5c5fe","schema_version":"1.0","event_id":"sha256:8c9dfb43761732e85cac1da4cb8cb60bcafc2453723054b95c5667c21de5c5fe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:XNIA3GNXC6C74O4O2LVG3R3A2Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cracking a hierarchical chaotic image encryption algorithm based on permutation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Chengqing Li","submitted_at":"2015-05-02T12:01:26Z","abstract_excerpt":"In year 2000, an efficient hierarchical chaotic image encryption (HCIE) algorithm was proposed, which divides a plain-image of size $M\\times N$ with $T$ possible value levels into $K$ blocks of the same size and then operates position permutation on two levels: intra-block and inter-block. As a typical position permutation-only encryption algorithm, it has received intensive attention. The present paper analyzes specific security performance of HCIE against ciphertext-only attack and known/chosen-plaintext attack. It is found that only $O(\\lceil\\log_T(M\\cdot N/K) \\rceil)$ known/chosen plain-im"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.00335","kind":"arxiv","version":2},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:04:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c4364faNclHliBc3w+w9jqdmc5zLCZJr9l9au3T9vJ9zbKs5JRCZujfWyuNg6ZrgqBCIA5XiZZr30twRN3MeDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:38:24.316809Z"},"content_sha256":"6b5f53ddbbe16f57a0693784230f216d7b9edc5214a28cb9ec2066b21aa247b1","schema_version":"1.0","event_id":"sha256:6b5f53ddbbe16f57a0693784230f216d7b9edc5214a28cb9ec2066b21aa247b1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XNIA3GNXC6C74O4O2LVG3R3A2Z/bundle.json","state_url":"https://pith.science/pith/XNIA3GNXC6C74O4O2LVG3R3A2Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XNIA3GNXC6C74O4O2LVG3R3A2Z/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-04T22:38:24Z","links":{"resolver":"https://pith.science/pith/XNIA3GNXC6C74O4O2LVG3R3A2Z","bundle":"https://pith.science/pith/XNIA3GNXC6C74O4O2LVG3R3A2Z/bundle.json","state":"https://pith.science/pith/XNIA3GNXC6C74O4O2LVG3R3A2Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XNIA3GNXC6C74O4O2LVG3R3A2Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:XNIA3GNXC6C74O4O2LVG3R3A2Z","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a99b5f0f44c3d7a4e511a09176ad3ffdc83b598bfa9cf376cfd4d9019c854606","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2015-05-02T12:01:26Z","title_canon_sha256":"40b6b07c558e8c987b0c9e21a4100b9b3006cd6f80072f317f99285c794c4181"},"schema_version":"1.0","source":{"id":"1505.00335","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.00335","created_at":"2026-05-18T01:04:00Z"},{"alias_kind":"arxiv_version","alias_value":"1505.00335v2","created_at":"2026-05-18T01:04:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.00335","created_at":"2026-05-18T01:04:00Z"},{"alias_kind":"pith_short_12","alias_value":"XNIA3GNXC6C7","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XNIA3GNXC6C74O4O","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XNIA3GNX","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:6b5f53ddbbe16f57a0693784230f216d7b9edc5214a28cb9ec2066b21aa247b1","target":"graph","created_at":"2026-05-18T01:04:00Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In year 2000, an efficient hierarchical chaotic image encryption (HCIE) algorithm was proposed, which divides a plain-image of size $M\\times N$ with $T$ possible value levels into $K$ blocks of the same size and then operates position permutation on two levels: intra-block and inter-block. As a typical position permutation-only encryption algorithm, it has received intensive attention. The present paper analyzes specific security performance of HCIE against ciphertext-only attack and known/chosen-plaintext attack. It is found that only $O(\\lceil\\log_T(M\\cdot N/K) \\rceil)$ known/chosen plain-im","authors_text":"Chengqing Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2015-05-02T12:01:26Z","title":"Cracking a hierarchical chaotic image encryption algorithm based on permutation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.00335","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8c9dfb43761732e85cac1da4cb8cb60bcafc2453723054b95c5667c21de5c5fe","target":"record","created_at":"2026-05-18T01:04:00Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a99b5f0f44c3d7a4e511a09176ad3ffdc83b598bfa9cf376cfd4d9019c854606","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2015-05-02T12:01:26Z","title_canon_sha256":"40b6b07c558e8c987b0c9e21a4100b9b3006cd6f80072f317f99285c794c4181"},"schema_version":"1.0","source":{"id":"1505.00335","kind":"arxiv","version":2}},"canonical_sha256":"bb500d99b71785fe3b8ed2ea6dc760d670fc402a8dfd7df101e4b312caa9519b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bb500d99b71785fe3b8ed2ea6dc760d670fc402a8dfd7df101e4b312caa9519b","first_computed_at":"2026-05-18T01:04:00.326376Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:00.326376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YZvCdl3CS25H5cxv41ccHu8KdwjjAvbWMw/GXsU6jBq72wmbsWyhQh+5dMPEeow8yi7LeteBneMG4n1YO0hSBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:00.326923Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.00335","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c9dfb43761732e85cac1da4cb8cb60bcafc2453723054b95c5667c21de5c5fe","sha256:6b5f53ddbbe16f57a0693784230f216d7b9edc5214a28cb9ec2066b21aa247b1"],"state_sha256":"c303657070592a57aecd165561543d05cde94d13f8f68ec68df200e96291c3a5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"og2xrpSr492QII+t3FiRSO7XZg8JNXRDaF6zn+97Hdppt0EaeKtlTUbUd7s9TdQjV0Rc+L2uJUC3EpDxPJ7kAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T22:38:24.320560Z","bundle_sha256":"aad0bb01a93c3f7cf139e0eab540141b90d1b11643aada7f8b8d471728030439"}}