On the oracle complexity of factoring integers
type: Item
instance of: scholarly article
title: On the oracle complexity of factoring integers
zbMATH Open document ID: 0851.68044
DOI: 10.1007/BF01206320
published in: Computational Complexity
publication date: 1996-11-17T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68P25
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 907998
zbMATH Keywords: oracle complexity
zbMATH Keywords: factoring
zbMATH Keywords: elliptic curves
zbMATH Keywords: cryptography
author: Ueli M. Maurer
MaRDI profile type: Publication
cites work: Q4341796
cites work: Factoring with Cyclotomic Polynomials
cites work: On a problem of Oppenheim concerning ''Factorisatio Numerorum''
cites work: On the power of two-point based sampling
cites work: Q4279676
cites work: Q4273679
cites work: Factoring integers with elliptic curves
cites work: Q3141896
cites work: Q4046106
cites work: Probabilistic algorithm for testing primality
cites work: A method for obtaining digital signatures and public-key cryptosystems
cites work: A Monte Carlo Factoring Algorithm With Linear Storage
description: scientific article; zbMATH DE number 907998