{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:PSOQFUJOA2MMF3B3QYL6Q2SG37","short_pith_number":"pith:PSOQFUJO","schema_version":"1.0","canonical_sha256":"7c9d02d12e0698c2ec3b8617e86a46dfe3628dc026612760cc645960dddafc77","source":{"kind":"arxiv","id":"1505.07553","version":3},"attestation_state":"computed","paper":{"title":"Computing Individual Discrete Logarithms Faster in GF$(p^n)$ with the NFS-DL Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"cs.CR","authors_text":"Aurore Guillevic (GRACE, LIX)","submitted_at":"2015-05-28T06:12:59Z","abstract_excerpt":"The Number Field Sieve (NFS) algorithm is the best known method to compute discrete logarithms (DL) in finite fields $\\mathbb{F}\\_{p^n}$, with $p$ medium to large and $n \\geq 1$ small. This algorithm comprises four steps: polynomial selection, relation collection, linear algebra and finally, individual logarithm computation. The first step outputs two polynomials defining two number fields, and a map from the polynomial ring over the integers modulo each of these polynomials to $\\mathbb{F}\\_{p^n}$. After the relation collection and linear algebra phases, the (virtual) logarithm of a subset of "},"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":"1505.07553","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2015-05-28T06:12:59Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"3678188ad974ec502d5c4228cbd0790c24a1498e1fb5e8e495bd8f50d850489b","abstract_canon_sha256":"8560d0a4eeadc4e6c4fb0cd29bcdfbd33f45b0248f360b45f4a7644faadac4a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:30.970703Z","signature_b64":"z7iLjp9GZwTaGk8oORbEgkdVegJ3dCrK3jZZBhd0dbx4wF71hGrn5jTVz59yABx9XyVj7ddj1XOzm/YfgQDRAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c9d02d12e0698c2ec3b8617e86a46dfe3628dc026612760cc645960dddafc77","last_reissued_at":"2026-05-18T01:13:30.970029Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:30.970029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing Individual Discrete Logarithms Faster in GF$(p^n)$ with the NFS-DL Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"cs.CR","authors_text":"Aurore Guillevic (GRACE, LIX)","submitted_at":"2015-05-28T06:12:59Z","abstract_excerpt":"The Number Field Sieve (NFS) algorithm is the best known method to compute discrete logarithms (DL) in finite fields $\\mathbb{F}\\_{p^n}$, with $p$ medium to large and $n \\geq 1$ small. This algorithm comprises four steps: polynomial selection, relation collection, linear algebra and finally, individual logarithm computation. The first step outputs two polynomials defining two number fields, and a map from the polynomial ring over the integers modulo each of these polynomials to $\\mathbb{F}\\_{p^n}$. After the relation collection and linear algebra phases, the (virtual) logarithm of a subset of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.07553","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":"1505.07553","created_at":"2026-05-18T01:13:30.970136+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.07553v3","created_at":"2026-05-18T01:13:30.970136+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.07553","created_at":"2026-05-18T01:13:30.970136+00:00"},{"alias_kind":"pith_short_12","alias_value":"PSOQFUJOA2MM","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"PSOQFUJOA2MMF3B3","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"PSOQFUJO","created_at":"2026-05-18T12:29:37.295048+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/PSOQFUJOA2MMF3B3QYL6Q2SG37","json":"https://pith.science/pith/PSOQFUJOA2MMF3B3QYL6Q2SG37.json","graph_json":"https://pith.science/api/pith-number/PSOQFUJOA2MMF3B3QYL6Q2SG37/graph.json","events_json":"https://pith.science/api/pith-number/PSOQFUJOA2MMF3B3QYL6Q2SG37/events.json","paper":"https://pith.science/paper/PSOQFUJO"},"agent_actions":{"view_html":"https://pith.science/pith/PSOQFUJOA2MMF3B3QYL6Q2SG37","download_json":"https://pith.science/pith/PSOQFUJOA2MMF3B3QYL6Q2SG37.json","view_paper":"https://pith.science/paper/PSOQFUJO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.07553&json=true","fetch_graph":"https://pith.science/api/pith-number/PSOQFUJOA2MMF3B3QYL6Q2SG37/graph.json","fetch_events":"https://pith.science/api/pith-number/PSOQFUJOA2MMF3B3QYL6Q2SG37/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PSOQFUJOA2MMF3B3QYL6Q2SG37/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PSOQFUJOA2MMF3B3QYL6Q2SG37/action/storage_attestation","attest_author":"https://pith.science/pith/PSOQFUJOA2MMF3B3QYL6Q2SG37/action/author_attestation","sign_citation":"https://pith.science/pith/PSOQFUJOA2MMF3B3QYL6Q2SG37/action/citation_signature","submit_replication":"https://pith.science/pith/PSOQFUJOA2MMF3B3QYL6Q2SG37/action/replication_record"}},"created_at":"2026-05-18T01:13:30.970136+00:00","updated_at":"2026-05-18T01:13:30.970136+00:00"}