**0**

# Cryptography in gamedev

###
#2
Crossbones+ - Reputation: **9966**

Posted 15 July 2012 - 06:08 PM

Furthermore cryptography in general is not a very useful tool when it comes to preventing cheating etc... Cryptography solves these problems:

- confidentiality (controlling who can read what you wrote)

- integrity (making sure a given message arrives intact to some destination)

- authenticity (knowing who produced/sent data)

In general these are not the problems you want to solve when making games.

**Edited by Bacterius, 15 July 2012 - 06:12 PM.**

The slowsort algorithm is a perfect illustration of the multiply and surrender paradigm, which is perhaps the single most important paradigm in the development of reluctant algorithms. The basic multiply and surrender strategy consists in replacing the problem at hand by two or more subproblems, each slightly simpler than the original, and continue multiplying subproblems and subsubproblems recursively in this fashion as long as possible. At some point the subproblems will all become so simple that their solution can no longer be postponed, and we will have to surrender. Experience shows that, in most cases, by the time this point is reached the total work will be substantially higher than what could have been wasted by a more direct approach.

- *Pessimal Algorithms and Simplexity Analysis*

###
#4
Crossbones+ - Reputation: **9966**

Posted 15 July 2012 - 09:02 PM

The slowsort algorithm is a perfect illustration of the multiply and surrender paradigm, which is perhaps the single most important paradigm in the development of reluctant algorithms. The basic multiply and surrender strategy consists in replacing the problem at hand by two or more subproblems, each slightly simpler than the original, and continue multiplying subproblems and subsubproblems recursively in this fashion as long as possible. At some point the subproblems will all become so simple that their solution can no longer be postponed, and we will have to surrender. Experience shows that, in most cases, by the time this point is reached the total work will be substantially higher than what could have been wasted by a more direct approach.

- *Pessimal Algorithms and Simplexity Analysis*

###
#6
Crossbones+ - Reputation: **9966**

Posted 15 July 2012 - 09:32 PM

Then sure I guess, but it has to be kept simple (cryptography understandable by average human beings, e.g. back to caesar's code or vigenere level stuff). Perhaps this should be moved to Game Design if it is going to be about how to integrate cryptographic concepts into game mechanics as puzzles or problem solving etc.. you will get more responses I think.puzzle mechanics.

The slowsort algorithm is a perfect illustration of the multiply and surrender paradigm, which is perhaps the single most important paradigm in the development of reluctant algorithms. The basic multiply and surrender strategy consists in replacing the problem at hand by two or more subproblems, each slightly simpler than the original, and continue multiplying subproblems and subsubproblems recursively in this fashion as long as possible. At some point the subproblems will all become so simple that their solution can no longer be postponed, and we will have to surrender. Experience shows that, in most cases, by the time this point is reached the total work will be substantially higher than what could have been wasted by a more direct approach.

- *Pessimal Algorithms and Simplexity Analysis*