On deterministic reduction of factoring integers to computing the exponents of elements in modular group

DOI10.3233/FI-2017-1521MaRDI QIDQ4595597zbMATH OpenOpenAlexFDO

Authors Jacek Pomykała

Publication date 5 December 2017

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2017-1521

zbMATH Keywords

primality testsBrun-Titchmarsh inequalityfactoring algorithms\(\mathbb Z_n\)-generating setsdeterministic reductionprime power decomposition

Mathematics Subject Classification ID

Factorization (11Y05) Factorization; primality (11A51)

Recommendations

• Integer factoring and compositeness witnesses
• On the oracle complexity of factoring integers
• Factoring $$N=p^rq^s$$ for Large r and s
• Deterministic integer factorization with oracles for Euler's totient function
• On oracle factoring of integers

Cited in

(3)

• Integer factoring and compositeness witnesses
• On exponents of modular subgroups generated by small consecutive integers
• A reduction of integer factorization to modular tetration

This page was built for publication: On deterministic reduction of factoring integers to computing the exponents of elements in modular group

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