Number-theoretical methods of factoring composite numbers and calculating the discrete logarithm

DOI10.1007/S10559-022-00463-0zbMATH Open1499.11368OpenAlexW4283277924MaRDI QIDQ2103786FDOQ2103786

M. V. Semotiuk

Publication date: 9 December 2022

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-022-00463-0

zbMATH Keywords

setfactorizationalgebradiscrete logarithmmodulusresidue ringnumber systemarithmetic operationradixaxiomatics of integersexponential function periodfaces of setnumber-theoretic transformation

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Factorization; primality (11A51) Primality (11Y11)

Cites Work

• Title not available (Why is that?)
• The geometry of numbers

Cited In (1)

• Computing Prime Factorization And Discrete Logarithms: From Index Calculus To Xedni Calculus

   Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Computation of discrete logarithms in an arbitrary finite field 👍 👎
• New series of rational approximations and some of their applications 👍 👎

This page was built for publication: Number-theoretical methods of factoring composite numbers and calculating the discrete logarithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2103786)