{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:KASUL6EGKFRU4K5HE4JNUDYBLW","short_pith_number":"pith:KASUL6EG","schema_version":"1.0","canonical_sha256":"502545f88651634e2ba72712da0f015d9c54f89f1e0d25d352eb0f194fba63e5","source":{"kind":"arxiv","id":"1402.3668","version":3},"attestation_state":"computed","paper":{"title":"Breaking `128-bit Secure' Supersingular Binary Curves (or how to solve discrete logarithms in ${\\mathbb F}_{2^{4 \\cdot 1223}}$ and ${\\mathbb F}_{2^{12 \\cdot 367}}$)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"math.NT","authors_text":"Jens Zumbr\\\"agel, Robert Granger, Thorsten Kleinjung","submitted_at":"2014-02-15T09:31:36Z","abstract_excerpt":"In late 2012 and early 2013 the discrete logarithm problem (DLP) in finite fields of small characteristic underwent a dramatic series of breakthroughs, culminating in a heuristic quasi-polynomial time algorithm, due to Barbulescu, Gaudry, Joux and Thom\\'e. Using these developments, Adj, Menezes, Oliveira and Rodr\\'iguez-Henr\\'iquez analysed the concrete security of the DLP, as it arises from pairings on (the Jacobians of) various genus one and two supersingular curves in the literature, which were originally thought to be $128$-bit secure. In particular, they suggested that the new algorithms "},"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":"1402.3668","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-02-15T09:31:36Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"ac27cc4a7c4156a83b311a1b5ba2057fe73636164890c0ebcb0ce037917979e1","abstract_canon_sha256":"1ea5bbd8efc51d749c2b8965dc9e334658eba51e30476103ed169242092dfecb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:53.636644Z","signature_b64":"8HgtvPJC6cZwLgdbetvDyl7WpZJx8flw/rUkTHLpk8hoS8NXWrIjcQKijWruqLhdsswCMS8yQW0B7PJEc2L5Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"502545f88651634e2ba72712da0f015d9c54f89f1e0d25d352eb0f194fba63e5","last_reissued_at":"2026-05-18T02:49:53.636152Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:53.636152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Breaking `128-bit Secure' Supersingular Binary Curves (or how to solve discrete logarithms in ${\\mathbb F}_{2^{4 \\cdot 1223}}$ and ${\\mathbb F}_{2^{12 \\cdot 367}}$)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"math.NT","authors_text":"Jens Zumbr\\\"agel, Robert Granger, Thorsten Kleinjung","submitted_at":"2014-02-15T09:31:36Z","abstract_excerpt":"In late 2012 and early 2013 the discrete logarithm problem (DLP) in finite fields of small characteristic underwent a dramatic series of breakthroughs, culminating in a heuristic quasi-polynomial time algorithm, due to Barbulescu, Gaudry, Joux and Thom\\'e. Using these developments, Adj, Menezes, Oliveira and Rodr\\'iguez-Henr\\'iquez analysed the concrete security of the DLP, as it arises from pairings on (the Jacobians of) various genus one and two supersingular curves in the literature, which were originally thought to be $128$-bit secure. In particular, they suggested that the new algorithms "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.3668","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":"1402.3668","created_at":"2026-05-18T02:49:53.636219+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.3668v3","created_at":"2026-05-18T02:49:53.636219+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3668","created_at":"2026-05-18T02:49:53.636219+00:00"},{"alias_kind":"pith_short_12","alias_value":"KASUL6EGKFRU","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"KASUL6EGKFRU4K5H","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"KASUL6EG","created_at":"2026-05-18T12:28:35.611951+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/KASUL6EGKFRU4K5HE4JNUDYBLW","json":"https://pith.science/pith/KASUL6EGKFRU4K5HE4JNUDYBLW.json","graph_json":"https://pith.science/api/pith-number/KASUL6EGKFRU4K5HE4JNUDYBLW/graph.json","events_json":"https://pith.science/api/pith-number/KASUL6EGKFRU4K5HE4JNUDYBLW/events.json","paper":"https://pith.science/paper/KASUL6EG"},"agent_actions":{"view_html":"https://pith.science/pith/KASUL6EGKFRU4K5HE4JNUDYBLW","download_json":"https://pith.science/pith/KASUL6EGKFRU4K5HE4JNUDYBLW.json","view_paper":"https://pith.science/paper/KASUL6EG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.3668&json=true","fetch_graph":"https://pith.science/api/pith-number/KASUL6EGKFRU4K5HE4JNUDYBLW/graph.json","fetch_events":"https://pith.science/api/pith-number/KASUL6EGKFRU4K5HE4JNUDYBLW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KASUL6EGKFRU4K5HE4JNUDYBLW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KASUL6EGKFRU4K5HE4JNUDYBLW/action/storage_attestation","attest_author":"https://pith.science/pith/KASUL6EGKFRU4K5HE4JNUDYBLW/action/author_attestation","sign_citation":"https://pith.science/pith/KASUL6EGKFRU4K5HE4JNUDYBLW/action/citation_signature","submit_replication":"https://pith.science/pith/KASUL6EGKFRU4K5HE4JNUDYBLW/action/replication_record"}},"created_at":"2026-05-18T02:49:53.636219+00:00","updated_at":"2026-05-18T02:49:53.636219+00:00"}