Factorizing RSA keys, an improved analogue solution

DOI10.1007/S00354-008-0059-3zbMath1180.68148OpenAlexW2029703763MaRDI QIDQ1031929

Ed Blakey

Publication date: 23 October 2009

Published in: New Generation Computing (Search for Journal in Brave)

Full work available at URL: https://ora.ox.ac.uk/objects/uuid:2ec00910-7e00-45db-b5ec-4155a505b919

zbMATH Keywords

computational complexityfactorizationanalogue computerprecision complexityRSA cryptography

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

Complexity-style resources in cryptography ⋮ Unconventional complexity measures for unconventional computers ⋮ Computational Complexity in Non-Turing Models of Computation

Cites Work

• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Factorizing RSA keys, an improved analogue solution