On reducing factorization to the discrete logarithm problem modulo a composite
type: Item
instance of: scholarly article
title: On reducing factorization to the discrete logarithm problem modulo a composite
zbMATH Open document ID: 1270.11127
author: Jacek Pomykała
author: Bartosz Źrałek
published in: Computational Complexity
publication date: 2012-08-24T00:00:00Z
Mathematics Subject Classification ID: 11Y05
Mathematics Subject Classification ID: 11Y16
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6072039
zbMATH Keywords: Integer factorization
zbMATH Keywords: discrete logarithm problem modulo a composite
zbMATH Keywords: deterministic subexponential time reduction
MaRDI profile type: Publication
full work available at URL: s00037-012-0037-5
OpenAlex ID: W2162104065
cites work: Q4847943
cites work: Small solutions to polynomial equations, and low exponent RSA vulnerabilities
cites work: Deterministic polynomial-time equivalence of computing the RSA secret key and factoring
cites work: Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
cites work: The development of the number field sieve
cites work: Factoring polynomials with rational coefficients
cites work: A key distribution system equivalent to factoring
cites work: Q4375614
cites work: A deterministic version of Pollard’s $p-1$ algorithm
DOI: 10.1007/S00037-012-0037-5
description: scientific article; zbMATH DE number 6072039