A Reduction of Integer Factorization to Modular Tetration

DOI10.1142/S0129054120500197zbMath1472.11312arXiv1707.04919OpenAlexW3098845467MaRDI QIDQ5859627

Markus Hittmeir

Publication date: 19 April 2021

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1707.04919

zbMATH Keywords

factorizationprimalitytetration

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16) Factorization (11Y05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Even faster integer multiplication
• Modular arithmetic of iterated powers
• On pairs of coprime integers with no large prime factors
• Some results on computational complexity
• Prime numbers and computer methods for factorization.
• Faster deterministic integer factorization
• A babystep-giantstep method for faster deterministic integer factorization
• Algorithms in Algebraic Number Theory
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier–Manin Operator

This page was built for publication: A Reduction of Integer Factorization to Modular Tetration