{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:UIIK47QVG2HRX7JOVFGHPWROZF","short_pith_number":"pith:UIIK47QV","schema_version":"1.0","canonical_sha256":"a210ae7e15368f1bfd2ea94c77da2ec94ffad5315879479290bcffc82cb2bc24","source":{"kind":"arxiv","id":"2304.03957","version":2},"attestation_state":"computed","paper":{"title":"A Continued Fraction-Hyperbola based Attack on RSA cryptosystem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"cs.CR","authors_text":"Basile Guy R. Bossoto, Gilda Rech Bansimba, Regis Freguin Babindamana","submitted_at":"2023-04-08T08:46:19Z","abstract_excerpt":"In this paper we present new arithmetical and algebraic results following the work of Babindamana and al. on hyperbolas and describe in the new results an approach to attacking a RSA-type modulus based on continued fractions, independent and not bounded by the size of the private key $d$ nor the public exponent $e$ compared to Wiener's attack. When successful, this attack is bounded by $\\displaystyle\\mathcal{O}\\left( b\\log{\\alpha_{j4}}\\log{(\\alpha_{i3}+\\alpha_{j3})}\\right)$ with $b=10^{y}$, $\\alpha_{i3}+\\alpha_{j3}$ a non trivial factor of $n$ and $\\alpha_{j4}$ such that $(n+1)/(n-1)=\\alpha_{i"},"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":"2304.03957","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2023-04-08T08:46:19Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"ac3b879bc19abdeeb7f2aa775dee29d504c7dddee776681f09f597244fb71293","abstract_canon_sha256":"b0234e16c97900fe11c9e4773a358b33cf8a514e2ec0282183288fd5c36f93cd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:08:25.675916Z","signature_b64":"0iVCA+5MtZgvRIwqSY0iAZII97nj+OIohkiKyWlngxVY8uzsB0MbYTNp4twQIMZKGrVecJz5xmw1ZkK/JWxFBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a210ae7e15368f1bfd2ea94c77da2ec94ffad5315879479290bcffc82cb2bc24","last_reissued_at":"2026-07-05T06:08:25.675533Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:08:25.675533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Continued Fraction-Hyperbola based Attack on RSA cryptosystem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"cs.CR","authors_text":"Basile Guy R. Bossoto, Gilda Rech Bansimba, Regis Freguin Babindamana","submitted_at":"2023-04-08T08:46:19Z","abstract_excerpt":"In this paper we present new arithmetical and algebraic results following the work of Babindamana and al. on hyperbolas and describe in the new results an approach to attacking a RSA-type modulus based on continued fractions, independent and not bounded by the size of the private key $d$ nor the public exponent $e$ compared to Wiener's attack. When successful, this attack is bounded by $\\displaystyle\\mathcal{O}\\left( b\\log{\\alpha_{j4}}\\log{(\\alpha_{i3}+\\alpha_{j3})}\\right)$ with $b=10^{y}$, $\\alpha_{i3}+\\alpha_{j3}$ a non trivial factor of $n$ and $\\alpha_{j4}$ such that $(n+1)/(n-1)=\\alpha_{i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.03957","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2304.03957/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2304.03957","created_at":"2026-07-05T06:08:25.675585+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.03957v2","created_at":"2026-07-05T06:08:25.675585+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.03957","created_at":"2026-07-05T06:08:25.675585+00:00"},{"alias_kind":"pith_short_12","alias_value":"UIIK47QVG2HR","created_at":"2026-07-05T06:08:25.675585+00:00"},{"alias_kind":"pith_short_16","alias_value":"UIIK47QVG2HRX7JO","created_at":"2026-07-05T06:08:25.675585+00:00"},{"alias_kind":"pith_short_8","alias_value":"UIIK47QV","created_at":"2026-07-05T06:08:25.675585+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.02502","citing_title":"GuardSec: A Multi-Modal Web Platform for Real-Time Digital Fraud Detection, Entity Verification, and Connection Security Analysis in the African Context","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UIIK47QVG2HRX7JOVFGHPWROZF","json":"https://pith.science/pith/UIIK47QVG2HRX7JOVFGHPWROZF.json","graph_json":"https://pith.science/api/pith-number/UIIK47QVG2HRX7JOVFGHPWROZF/graph.json","events_json":"https://pith.science/api/pith-number/UIIK47QVG2HRX7JOVFGHPWROZF/events.json","paper":"https://pith.science/paper/UIIK47QV"},"agent_actions":{"view_html":"https://pith.science/pith/UIIK47QVG2HRX7JOVFGHPWROZF","download_json":"https://pith.science/pith/UIIK47QVG2HRX7JOVFGHPWROZF.json","view_paper":"https://pith.science/paper/UIIK47QV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.03957&json=true","fetch_graph":"https://pith.science/api/pith-number/UIIK47QVG2HRX7JOVFGHPWROZF/graph.json","fetch_events":"https://pith.science/api/pith-number/UIIK47QVG2HRX7JOVFGHPWROZF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UIIK47QVG2HRX7JOVFGHPWROZF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UIIK47QVG2HRX7JOVFGHPWROZF/action/storage_attestation","attest_author":"https://pith.science/pith/UIIK47QVG2HRX7JOVFGHPWROZF/action/author_attestation","sign_citation":"https://pith.science/pith/UIIK47QVG2HRX7JOVFGHPWROZF/action/citation_signature","submit_replication":"https://pith.science/pith/UIIK47QVG2HRX7JOVFGHPWROZF/action/replication_record"}},"created_at":"2026-07-05T06:08:25.675585+00:00","updated_at":"2026-07-05T06:08:25.675585+00:00"}