Short Review on “A high-performance and energy-efficient exhaustive key search approach via GPU on DES-like cryptosystems”

  • Author(s) / Creator(s)
  • Recently, graphical processing units (GPUs) have found a prominent role in general-purpose applications. Specifically, in parallel processing applications where a
    considerable number of tasks should be processed while meeting specific design
    constraints. One of the most interesting subjects in this area is cipher breaking via brute force attacks, which attracts the attention of many researchers to the field. In this paper,
    we introduce a novel exhaustive key search approach for block cipher cryptosystems.
    The key point is how to utilize the single instruction multiple thread architecture to
    improve the speed of the DES-like hardware-based cryptosystems. At first, the standard
    DES core is implemented while all operations like bit permutation, swapping, and
    general hardware data stream follow the original algorithm. Then, in order to maximize
    the usage of the memory bandwidth and to eliminate the bit access penalty in GPU
    architecture, we exploit the register permutation and swapping (instead of the
    conventional bit swapping) in our implementation. In this approach, each thread
    examines a set of 32 keys per each iteration and hence a considerable throughput is
    achieved. The experimental results demonstrate 24KX, 800X, and 400X speedup over
    the traditional DES implementation on single-core CPU, the best previous work on
    multi-core CPU, and the conventional implementation on GPU, respectively.
    Furthermore, we measure the power and energy consumption of the best GPU and CPU
    approaches, where the GPU implementation proves to be more power-efficient.

  • Date created
    2020-05-27
  • Subjects / Keywords
  • Type of Item
    Review
  • DOI
    https://doi.org/10.7939/r3-3ddq-9f23
  • License
    Attribution-NonCommercial 4.0 International