{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T10:10:02Z","timestamp":1755857402180,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,7,24]],"date-time":"2023-07-24T00:00:00Z","timestamp":1690156800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,7,24]]},"DOI":"10.1145\/3597066.3597108","type":"proceedings-article","created":{"date-parts":[[2023,7,5]],"date-time":"2023-07-05T18:15:27Z","timestamp":1688580927000},"page":"490-497","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["New Characterization of the Factor Refinement Algorithm with Applications"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-7231-8758","authenticated-orcid":false,"given":"Aditya","family":"Ravi","sequence":"first","affiliation":[{"name":"University of Michigan, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7616-0751","authenticated-orcid":false,"given":"Ilya","family":"Volkovich","sequence":"additional","affiliation":[{"name":"Boston College, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,7,24]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"First International Symposium, ANTS-I","author":"Adleman M.","year":"1994","unstructured":"L.\u00a0M. Adleman and K.\u00a0S. McCurley. 1994. Open problems in number theoretic complexity, II. In Algorithmic Number Theory, First International Symposium, ANTS-I, Ithaca, NY, USA, May 6-9, 1994, Proceedings. 291\u2013322."},{"key":"e_1_3_2_1_2_1","volume-title":"8th Annual International Cryptology Conference","author":"Bach E.","year":"1988","unstructured":"E. Bach. 1988. Intractable Problems in Number Theory. In Advances in Cryptology - CRYPTO \u201988, 8th Annual International Cryptology Conference, Santa Barbara, California, USA, August 21-25, 1988, Proceedings. 77\u201393."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1993.1038"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/0215083"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.04.009"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-06-01837-0"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-99-01023-6"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"M. Burmester Y. Desmedt and J. Seberry. 1998. Equitable Key Escrow with Limited Time Span (or How to Enforce Time Expiration Cryptographically). In Advances in Cryptology - ASIACRYPT(Lecture Notes in Computer Science Vol.\u00a01514) K.\u00a0Ohta and D.\u00a0Pei (Eds.). Springer 380\u2013391.","DOI":"10.1007\/3-540-49649-1_30"},{"key":"e_1_3_2_1_9_1","volume-title":"European Conference on Computer Algebra","author":"Kaltofen E.","year":"1985","unstructured":"E. Kaltofen. 1985. Sparse Hensel Lifting. In EUROCAL \u201985, European Conference on Computer Algebra, Linz, Austria.(Lecture Notes in Computer Science, Vol.\u00a0204), B.\u00a0F. Caviness (Ed.). Springer, 4\u201317."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-50026-9_19"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(88)90028-4"},{"key":"e_1_3_2_1_12_1","unstructured":"D.\u00a0L. Long. 1981. Random equivalence of factorization and computation of orders. Technical Report 284. Princeton University."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(76)80043-8"},{"key":"e_1_3_2_1_14_1","unstructured":"F. Morain G. Renault and B. Smith. 2018. Deterministic factoring with oracles. CoRR abs\/1802.08444 (2018). http:\/\/arxiv.org\/abs\/1802.08444"},{"volume-title":"On a function connected with \u03d5(n). Bull. Amer. Math. Soc. 35, 6 (11","year":"1929","key":"e_1_3_2_1_15_1","unstructured":"S.\u00a0Sivasankaranarayana Pillai. 1929. On a function connected with \u03d5(n). Bull. Amer. Math. Soc. 35, 6 (11 1929), 837\u2013841."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(85)90084-5"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/96877.96961"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0024-3795(98)10012-5"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(87)90030-7"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-09-02262-5"}],"event":{"name":"ISSAC 2023: International Symposium on Symbolic and Algebraic Computation 2023","acronym":"ISSAC 2023","location":"Troms\u00f8 Norway"},"container-title":["Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3597066.3597108","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3597066.3597108","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T09:37:36Z","timestamp":1755855456000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3597066.3597108"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,24]]},"references-count":20,"alternative-id":["10.1145\/3597066.3597108","10.1145\/3597066"],"URL":"https:\/\/doi.org\/10.1145\/3597066.3597108","relation":{},"subject":[],"published":{"date-parts":[[2023,7,24]]},"assertion":[{"value":"2023-07-24","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}