vix.ing · top · new · best · stats · spec

Quantifying Shannon's Work Function for Cryptanalytic Attacks

2010/03/10 by R.J.J.H. van Son, R. J. J. H. van Son, van Son, R. J. J. H.
Computer Science · #Advanced Malware Detection Techniques #Chaos-based Image/Signal Encryption #Cryptographic Implementations and Security #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #cs.CR

paper · pdf · doi:10.48550/arxiv.1003.2123

19 pages

arxiv created 2010/03/10 · openalex publication_date 2010/03/10 · arxiv updated 2010/03/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/04

Abstract

Attacks on cryptographic systems are limited by the available computational resources. A theoretical understanding of these resource limitations is needed to evaluate the security of cryptographic primitives and procedures. This study uses an Attacker versus Environment game formalism based on computability logic to quantify Shannon's work function and evaluate resource use in cryptanalysis. A simple cost function is defined which allows to quantify a wide range of theoretical and real computational resources. With this approach the use of custom hardware, e.g., FPGA boards, in cryptanalysis can be analyzed. Applied to real cryptanalytic problems, it raises, for instance, the expectation that the computer time needed to break some simple 90 bit strong cryptographic primitives might theoretically be less than two years.

Citations

Related