{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T09:44:26Z","timestamp":1766223866859,"version":"3.48.0"},"reference-count":21,"publisher":"Walter de Gruyter GmbH","issue":"1","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,4,14]]},"abstract":"Abstract<\/jats:title>\n \n Let\n \n \n \n \n Q<\/m:mi>\n \n (<\/m:mo>\n \n \u03b1<\/m:mi>\n <\/m:mrow>\n )<\/m:mo>\n <\/m:mrow>\n <\/m:math>\n {\\mathbb{Q}}\\left(\\alpha )<\/jats:tex-math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n and\n \n \n \n \n Q<\/m:mi>\n \n (<\/m:mo>\n \n \u03b2<\/m:mi>\n <\/m:mrow>\n )<\/m:mo>\n <\/m:mrow>\n <\/m:math>\n {\\mathbb{Q}}\\left(\\beta )<\/jats:tex-math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n be linearly disjoint number fields and let\n \n \n \n \n Q<\/m:mi>\n \n (<\/m:mo>\n \n \u03b8<\/m:mi>\n <\/m:mrow>\n )<\/m:mo>\n <\/m:mrow>\n <\/m:math>\n {\\mathbb{Q}}\\left(\\theta )<\/jats:tex-math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n be their compositum. We prove that the first-degree prime ideals (FDPIs) of\n \n \n \n \n Z<\/m:mi>\n \n [<\/m:mo>\n \n \u03b8<\/m:mi>\n <\/m:mrow>\n ]<\/m:mo>\n <\/m:mrow>\n <\/m:math>\n {\\mathbb{Z}}\\left[\\theta ]<\/jats:tex-math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n may almost always be constructed in terms of the FDPIs of\n \n \n \n \n Z<\/m:mi>\n \n [<\/m:mo>\n \n \u03b1<\/m:mi>\n <\/m:mrow>\n ]<\/m:mo>\n <\/m:mrow>\n <\/m:math>\n {\\mathbb{Z}}\\left[\\alpha ]<\/jats:tex-math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n and\n \n \n \n \n Z<\/m:mi>\n \n [<\/m:mo>\n \n \u03b2<\/m:mi>\n <\/m:mrow>\n ]<\/m:mo>\n <\/m:mrow>\n <\/m:math>\n {\\mathbb{Z}}\\left[\\beta ]<\/jats:tex-math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n , and\n vice versa<\/jats:italic>\n . We identify the cases where this correspondence does not hold, and provide explicit counterexamples for each obstruction. We show that for every pair of coprime integers\n \n \n \n \n d<\/m:mi>\n ,<\/m:mo>\n e<\/m:mi>\n \u2208<\/m:mo>\n Z<\/m:mi>\n <\/m:math>\n d,e\\in {\\mathbb{Z}}<\/jats:tex-math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n , such a correspondence almost always respects the divisibility of principal ideals of the form\n \n \n \n \n \n (<\/m:mo>\n \n e<\/m:mi>\n +<\/m:mo>\n d<\/m:mi>\n \u03b8<\/m:mi>\n <\/m:mrow>\n )<\/m:mo>\n <\/m:mrow>\n Z<\/m:mi>\n \n [<\/m:mo>\n \n \u03b8<\/m:mi>\n <\/m:mrow>\n ]<\/m:mo>\n <\/m:mrow>\n <\/m:math>\n \\left(e+d\\theta ){\\mathbb{Z}}\\left[\\theta ]<\/jats:tex-math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n , with a few exceptions that we characterize. Finally, we establish the asymptotic computational improvement of such an approach, and we verify the reduction in time needed for computing such primes for certain concrete cases.\n <\/jats:p>","DOI":"10.1515\/jmc-2024-0036","type":"journal-article","created":{"date-parts":[[2025,4,14]],"date-time":"2025-04-14T11:57:16Z","timestamp":1744631836000},"source":"Crossref","is-referenced-by-count":0,"title":["First-degree prime ideals of composite extensions"],"prefix":"10.1515","volume":"19","author":[{"given":"Giordano","family":"Santilli","sequence":"first","affiliation":[{"name":"Agenzia per la Cybersicurezza Nazionale , Rome , Italy"}]},{"given":"Daniele","family":"Taufer","sequence":"additional","affiliation":[{"name":"Department of Computer Science, KU Leuven , Leuven , Belgium"}]}],"member":"374","published-online":{"date-parts":[[2025,4,14]]},"reference":[{"key":"2025122009205492462_j_jmc-2024-0036_ref_001","doi-asserted-by":"crossref","unstructured":"Hilbert D. The theory of algebraic number fields. Berlin-Heidelberg: Springer; 1998.","DOI":"10.1007\/978-3-662-03545-0"},{"key":"2025122009205492462_j_jmc-2024-0036_ref_002","doi-asserted-by":"crossref","unstructured":"Buhler JP, Lenstra HW, Pomerance C. Factoring integers with the number field sieve. in: The development of the number field sieve. Berlin-Heidelberg: Springer; 1993. p. 50\u201394.","DOI":"10.1007\/BFb0091539"},{"key":"2025122009205492462_j_jmc-2024-0036_ref_003","doi-asserted-by":"crossref","unstructured":"Bernstein DJ, Lenstra AK. A general number field sieve implementation. in: The development of the number field sieve, Berlin-Heidelberg: Springer; 1993. p. 103\u201326.","DOI":"10.1007\/BFb0091541"},{"key":"2025122009205492462_j_jmc-2024-0036_ref_004","doi-asserted-by":"crossref","unstructured":"Lenstra AK, Lenstra HW, Manasse MS, Pollard JM. The number field sieve. in: The development of the number field sieve, Berlin-Heidelberg: Springer; 1993. p. 11\u201342.","DOI":"10.1007\/BFb0091537"},{"key":"2025122009205492462_j_jmc-2024-0036_ref_005","doi-asserted-by":"crossref","unstructured":"Gordon DM. Discrete logarithms in GF(p) using the number field sieve. SIAM J Discrete Math. 1993;6(1):124\u201338.","DOI":"10.1137\/0406010"},{"key":"2025122009205492462_j_jmc-2024-0036_ref_006","doi-asserted-by":"crossref","unstructured":"Barbulescu R, Gaudry P, Kleinjung T. The tower number field sieve. ASIACRYPT 2015;2015:31\u201355.","DOI":"10.1007\/978-3-662-48800-3_2"},{"key":"2025122009205492462_j_jmc-2024-0036_ref_007","doi-asserted-by":"crossref","unstructured":"Joux A, Pierrot C. The special number field sieve in Fpn. in: Pairing-Based Cryptography - Pairing 2013; 2014. p. 45\u201361.","DOI":"10.1007\/978-3-319-04873-4_3"},{"key":"2025122009205492462_j_jmc-2024-0036_ref_008","unstructured":"Cohn PM. Algebra. Vol. 3. Wiley; 1991."},{"key":"2025122009205492462_j_jmc-2024-0036_ref_009","doi-asserted-by":"crossref","unstructured":"Khanduja SK. The discriminant of compositum of algebraic number fields. Int J Number Theory. 2019;15(2):353\u201360.","DOI":"10.1142\/S1793042119500167"},{"key":"2025122009205492462_j_jmc-2024-0036_ref_010","doi-asserted-by":"crossref","unstructured":"Santilli G, Taufer D. First-degree prime ideals of biquadratic fields dividing prescribed principal ideals. Mathematics. 2020;8(9):1433.","DOI":"10.3390\/math8091433"},{"key":"2025122009205492462_j_jmc-2024-0036_ref_011","doi-asserted-by":"crossref","unstructured":"Lang S. Algebra. New York: Springer; 2002.","DOI":"10.1007\/978-1-4613-0041-0"},{"key":"2025122009205492462_j_jmc-2024-0036_ref_012","doi-asserted-by":"crossref","unstructured":"Isaacs IM. Degrees of sums in a separable field extension. Proc Am Math Soc. 1970;25(3):638\u201341.","DOI":"10.2307\/2036661"},{"key":"2025122009205492462_j_jmc-2024-0036_ref_013","doi-asserted-by":"crossref","unstructured":"Cohen H. Advanced topics in computational number theory. New York: Springer; 2000.","DOI":"10.1007\/978-1-4419-8489-0"},{"key":"2025122009205492462_j_jmc-2024-0036_ref_014","doi-asserted-by":"crossref","unstructured":"Lidl R, Niederreiter H. Finite fields. Cambridge: Cambridge University Press; 1996.","DOI":"10.1017\/CBO9780511525926"},{"key":"2025122009205492462_j_jmc-2024-0036_ref_015","doi-asserted-by":"crossref","unstructured":"Bosma W, Cannon J, Playoust C. The Magma algebra system. I. The user language. J Symbolic Comput. 1997;24:235\u201365.","DOI":"10.1006\/jsco.1996.0125"},{"key":"2025122009205492462_j_jmc-2024-0036_ref_016","doi-asserted-by":"crossref","unstructured":"Berlekamp ER, Factoring polynomials over large finite fields. Math Comp. 1970;24:713\u201335.","DOI":"10.1090\/S0025-5718-1970-0276200-X"},{"key":"2025122009205492462_j_jmc-2024-0036_ref_017","doi-asserted-by":"crossref","unstructured":"Kaltofen E, Shoup V. Subquadratic-time factoring of polynomials over finite fields. Math Comp. 1998;67:1179\u201397.","DOI":"10.1090\/S0025-5718-98-00944-2"},{"key":"2025122009205492462_j_jmc-2024-0036_ref_018","doi-asserted-by":"crossref","unstructured":"Kedlaya K, Umans C. Fast polynomial factorization and modular composition. SIAM J Comput. 2011;40(6):1767\u2013802.","DOI":"10.1137\/08073408X"},{"key":"2025122009205492462_j_jmc-2024-0036_ref_019","unstructured":"Bai S, Thom\u00e9 E, Zimmermann P. Factorisation of RSA-704 with CADO-NFS. 2012; hal-00760322."},{"key":"2025122009205492462_j_jmc-2024-0036_ref_020","doi-asserted-by":"crossref","unstructured":"Kleinjung T, Aoki K, Franke J, Lenstra AK, Thom\u00e9 E, Bos JS, et al. Factorization of a 768-bit RSA modulus. In: CRYPTO 2010; 2010. p. 333\u201350.","DOI":"10.1007\/978-3-642-14623-7_18"},{"key":"2025122009205492462_j_jmc-2024-0036_ref_021","unstructured":"Briggs ME. An introduction to the general number field sieve. Ph.D. Dissertation. Virginia Tech; 1998."}],"container-title":["Journal of Mathematical Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2024-0036\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2024-0036\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T09:39:18Z","timestamp":1766223558000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2024-0036\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,1]]},"references-count":21,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,4,14]]},"published-print":{"date-parts":[[2025,4,14]]}},"alternative-id":["10.1515\/jmc-2024-0036"],"URL":"https:\/\/doi.org\/10.1515\/jmc-2024-0036","relation":{},"ISSN":["1862-2984"],"issn-type":[{"type":"electronic","value":"1862-2984"}],"subject":[],"published":{"date-parts":[[2025,1,1]]},"article-number":"20240036"}}