On the oracle complexity of factoring integers

descriptionPublicationkeyboard_double_arrow_right Article 01 Sep 1995 English Publisher:Springer Science and Business Media LLCJournal:Computational Complexity, volume 5, pages 237-247 (issn: 1016-3328, eissn: 1420-8954,

Copyright policy )

Authors: Ueli M. Maurer;

doi: 10.1007/bf01206320

On the oracle complexity of factoring integers

- Summary
- Subjects
- Metrics

Abstract

zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Related Organizations

École Polytechnique Fédérale de Lausanne EPFL
Switzerland

Keywords

oracle complexity, cryptography, Data encryption (aspects in computer science), Analysis of algorithms and problem complexity, elliptic curves, Abstract computational complexity for mathematical programming problems, factoring

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	8
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average