Complexity-style resources in cryptography

DOI10.1016/J.IC.2013.03.002zbMath1277.68090arXiv1303.2974OpenAlexW2024421178MaRDI QIDQ385706

Ed Blakey

Publication date: 3 December 2013

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1303.2974

zbMATH Keywords

computational complexitycryptographysecurityfactorizationresourceunconventional computation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Cites Work

• Unnamed Item
• Factorizing RSA keys, an improved analogue solution
• The differential analyzer. A new machine for solving differential equations
• Unconventional complexity measures for unconventional computers
• A method for obtaining digital signatures and public-key cryptosystems

This page was built for publication: Complexity-style resources in cryptography