Complexity-style resources in cryptography

DOI10.1016/J.IC.2013.03.002MaRDI QIDQ385706zbMATH OpenOpenAlexFDO

Authors 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 complexityfactorizationcryptographysecurityresourceunconventional computation

Mathematics Subject Classification ID

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

Abstract: Previously, the author has developed a framework within which to quantify and compare the resources consumed during computational-especially unconventional computational-processes (adding to the familiar resources of run-time and memory space such non-standard resources as precision and energy); it is natural and beneficial in this framework to employ various complexity-theoretic tools and techniques. Here, we seek an analogous treatment not of computational processes but of cryptographic protocols and similar, so as to be able to apply the existing arsenal of complexity-theoretic methods in new ways, in the derivation and verification of protocols in a wider, cryptographic context. Accordingly, we advocate a framework in which one may view as resources the costs-which may be related to computation, communication, information (including side-channel information) or availability of primitives, for example-incurred when executing cryptographic protocols, coin-tossing schemes, etc. The ultimate aim is to formulate as a resource, and be able to analyse complexity-theoretically, the security of these protocols and schemes.

Recommendations

• scientific article; zbMATH DE number 3965967
• Constructive cryptography -- a new paradigm for security definitions and proofs
• Cryptographic primitives enforcing communication and storage complexity
• Cryptography and cryptographic protocols
• Information security as a resource

Cites work

• scientific article; zbMATH DE number 3888913 (Why is no real title available?)
• A method for obtaining digital signatures and public-key cryptosystems
• Factorizing RSA keys, an improved analogue solution
• The differential analyzer. A new machine for solving differential equations
• Unconventional complexity measures for unconventional computers

Cited in

(1)

• Resource fairness and composability of cryptographic protocols

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q385706)