Deterministic integer factorization with oracles for Euler's totient function

DOI10.3233/FI-2020-1891MaRDI QIDQ5131778zbMATH OpenOpenAlexFDO

Authors Markus Hittmeir, Jacek Pomykała

Publication date 9 November 2020

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2020-1891

zbMATH Keywords

deterministic reductionfactorizationtotient function

Mathematics Subject Classification ID

Factorization (11Y05) General topics in the theory of algorithms (68W01)

Recommendations

• On oracle factoring of integers
• A deterministic version of Pollard's p-1 algorithm
• scientific article; zbMATH DE number 503356
• An extension of a result about divisors in a residue class and its application to reducing integer factorization to computing Euler’s totient
• On the oracle complexity of factoring integers

Cited in

(7)

• Complete divisibility problems for slowly utilized oracles
• On oracle factoring of integers
• A deterministic version of Pollard's p-1 algorithm
• On deterministic reduction of factoring integers to computing the exponents of elements in modular group
• Deterministic factoring with oracles
• Factorization, malleability and equivalent problems
• Elliptic-curve factoring, witnesses and oracles

This page was built for publication: Deterministic integer factorization with oracles for Euler's totient function

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