{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:PT6UUXA6VERCSKSC3FOLNXPLKF","short_pith_number":"pith:PT6UUXA6","schema_version":"1.0","canonical_sha256":"7cfd4a5c1ea922292a42d95cb6ddeb514a460f67a73df63aca0c04e57e719641","source":{"kind":"arxiv","id":"1902.02332","version":2},"attestation_state":"computed","paper":{"title":"Benchmarking the quantum cryptanalysis of symmetric, public-key and hash-based cryptographic schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Michele Mosca, Vlad Gheorghiu","submitted_at":"2019-02-06T18:48:27Z","abstract_excerpt":"Quantum algorithms can break factoring and discrete logarithm based cryptography and weaken symmetric cryptography and hash functions. In order to estimate the real-world impact of these attacks, apart from tracking the development of fault-tolerant quantum computers it is important to have an estimate of the resources needed to implement these quantum attacks.\n  For attacking symmetric cryptography and hash functions, generic quantum attacks are substantially less powerful than they are for today's public-key cryptography. So security will degrade gradually as quantum computing resources incr"},"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":"1902.02332","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-02-06T18:48:27Z","cross_cats_sorted":[],"title_canon_sha256":"7b23a836176a0104ba167575a7d20fcc687c91d2fd14e435b79ebd918a5ca694","abstract_canon_sha256":"398334627d6c86595196f92b2e94c9b9b9d315f9108d03aa382f4347bf0ec5f7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:31.307495Z","signature_b64":"EoxaffoE4cao2tjm4TmDmivNQKwapNHXwv7/daqGWzSR+erKfpAuC/i7WGlfdkYHHsWCAcHhzodj0BKTtBl2Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7cfd4a5c1ea922292a42d95cb6ddeb514a460f67a73df63aca0c04e57e719641","last_reissued_at":"2026-05-17T23:54:31.306783Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:31.306783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Benchmarking the quantum cryptanalysis of symmetric, public-key and hash-based cryptographic schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Michele Mosca, Vlad Gheorghiu","submitted_at":"2019-02-06T18:48:27Z","abstract_excerpt":"Quantum algorithms can break factoring and discrete logarithm based cryptography and weaken symmetric cryptography and hash functions. In order to estimate the real-world impact of these attacks, apart from tracking the development of fault-tolerant quantum computers it is important to have an estimate of the resources needed to implement these quantum attacks.\n  For attacking symmetric cryptography and hash functions, generic quantum attacks are substantially less powerful than they are for today's public-key cryptography. So security will degrade gradually as quantum computing resources incr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.02332","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1902.02332","created_at":"2026-05-17T23:54:31.306882+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.02332v2","created_at":"2026-05-17T23:54:31.306882+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.02332","created_at":"2026-05-17T23:54:31.306882+00:00"},{"alias_kind":"pith_short_12","alias_value":"PT6UUXA6VERC","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"PT6UUXA6VERCSKSC","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"PT6UUXA6","created_at":"2026-05-18T12:33:24.271573+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2410.13759","citing_title":"On the practicality of quantum sieving algorithms for the shortest vector problem","ref_index":86,"is_internal_anchor":true},{"citing_arxiv_id":"2603.28846","citing_title":"Securing Elliptic Curve Cryptocurrencies against Quantum Vulnerabilities: Resource Estimates and Mitigations","ref_index":110,"is_internal_anchor":true},{"citing_arxiv_id":"2409.17595","citing_title":"Magic state cultivation: growing T states as cheap as CNOT gates","ref_index":95,"is_internal_anchor":false},{"citing_arxiv_id":"2605.03951","citing_title":"Factoring $2048$ bit RSA integers with a half-million-qubit modular atomic processor","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2604.15584","citing_title":"A Framework for Post Quantum Migration in IoT-Based Healthcare Systems","ref_index":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PT6UUXA6VERCSKSC3FOLNXPLKF","json":"https://pith.science/pith/PT6UUXA6VERCSKSC3FOLNXPLKF.json","graph_json":"https://pith.science/api/pith-number/PT6UUXA6VERCSKSC3FOLNXPLKF/graph.json","events_json":"https://pith.science/api/pith-number/PT6UUXA6VERCSKSC3FOLNXPLKF/events.json","paper":"https://pith.science/paper/PT6UUXA6"},"agent_actions":{"view_html":"https://pith.science/pith/PT6UUXA6VERCSKSC3FOLNXPLKF","download_json":"https://pith.science/pith/PT6UUXA6VERCSKSC3FOLNXPLKF.json","view_paper":"https://pith.science/paper/PT6UUXA6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.02332&json=true","fetch_graph":"https://pith.science/api/pith-number/PT6UUXA6VERCSKSC3FOLNXPLKF/graph.json","fetch_events":"https://pith.science/api/pith-number/PT6UUXA6VERCSKSC3FOLNXPLKF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PT6UUXA6VERCSKSC3FOLNXPLKF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PT6UUXA6VERCSKSC3FOLNXPLKF/action/storage_attestation","attest_author":"https://pith.science/pith/PT6UUXA6VERCSKSC3FOLNXPLKF/action/author_attestation","sign_citation":"https://pith.science/pith/PT6UUXA6VERCSKSC3FOLNXPLKF/action/citation_signature","submit_replication":"https://pith.science/pith/PT6UUXA6VERCSKSC3FOLNXPLKF/action/replication_record"}},"created_at":"2026-05-17T23:54:31.306882+00:00","updated_at":"2026-05-17T23:54:31.306882+00:00"}