Compromise time-memory
The compromised time-memory are used in Cryptanalyse to recover secret information while being pressed on precalculated tables. This method was formalized by Martin Hellman in his article has cryptanalytic time-memory trade-off published in 1980.
As its name suggests it, this probabilistic method is halfway between the exhaustive Recherche (which requires much time) and the complete storage of all the solutions in memory (which requires an enormous storage capacity according to the problem). Thanks to tables judiciously calculated in advance, it is possible to decrease the search time, while avoiding storing too many information.
Improvements
The most known improvement is that of Philippe Oechslin, in 2003, which optimized the principle to lead to a named structure Table rainbow . Its method proves very effective, for example, to recover passwords of LAN Manager since their impressed numerical.
External bonds
- '' has cryptanalytic time-memory trade-off '' - Martin Hellman
- '' the compromises time-memory and their use to break the passwords Windows '' - Philippe Oechlin (conference SSTIC 2004)
| Random links: | Pit Shepherd | Truce of Avignon | Gede (Indonesia) | Automobile Grand Prix of Great Britain 1979 | Valentino Bompiani | Poivre_de_Malagueta |