Work

A Reduction of Integer Factorization to Modular Tetration

Year: 2020

Type: article

Abstract: Let [Formula: see text]. By [Formula: see text] and [Formula: see text], we denote the [Formula: see text] th iterate of the exponential function [Formula: see text] evaluated at [Formula: see text], also known as tetration. We demonstrate how an algorithm for evaluating tetration modulo natural numbers [Formula: see text] could be used to compute the prime factorization of [Formula: see text] and provide heuristic arguments for the efficiency of this reduction. Additionally, we prove that the problem of computing the squarefree part of integers is deterministically polynomial-time reducible to modular tetration.

Source: International Journal of Foundations of Computer Science

DOI: 10.1142/s0129054120500197

Author: Markus Hittmeir

Institution: SBA Research

Language: English

Topic: Cryptography and Residue Arithmetic

Subfield: Information Systems

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2767450684

FWCI: 0.231

Cites: 10

Cited by: 2

Related to: