On the Complexity of Implementation Some Cryptanalysis Methods by Distributed Computing
The subject of the research is an investigation on the distributed computing efficiency in the analysis of cryptographic systems by different key search methods: meet-in-the-middle, sequential key search and Hellman method. The leading results of the research are presented in the paper.
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Moscow Engineering Physics Institute
2011-12-01
|
| Series: | Bezopasnostʹ Informacionnyh Tehnologij |
| Subjects: | |
| Online Access: | https://bit.mephi.ru/index.php/bit/article/view/578 |