Quantifying Shannon's Work Function for Cryptanalytic Attacks

Details Quantifying Shannon's Work Function for Cryptanalytic Attacks Quantifying Shannon's Work Function for Cryptanalytic Attacks

2010-03-10

arxiv.org/abs/1003.2123v1

Computer Science

Cryptography and Security

19 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Quantifying Shannon's Work Function for Cryptanalytic Attacks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Quantifying Shannon's Work Function for Cryptanalytic Attacks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantifying Shannon's Work Function for Cryptanalytic Attacks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-342135