International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Time-Memory Analysis of Parallel Collision Search Algorithms

Authors:
Monika Trimoska , Laboratoire MIS, Université de Picardie Jules Verne, Amiens, France
Sorina Ionica , Laboratoire MIS, Université de Picardie Jules Verne, Amiens, France
Gilles Dequen , Laboratoire MIS, Université de Picardie Jules Verne, Amiens, France
Download:
DOI: 10.46586/tches.v2021.i2.254-274
URL: https://tches.iacr.org/index.php/TCHES/article/view/8794
Search ePrint
Search Google
Abstract: Parallel versions of collision search algorithms require a significant amount of memory to store a proportion of the points computed by the pseudo-random walks. Implementations available in the literature use a hash table to store these points and allow fast memory access. We provide theoretical evidence that memory is an important factor in determining the runtime of this method. We propose to replace the traditional hash table by a simple structure, inspired by radix trees, which saves space and provides fast look-up and insertion. In the case of many-collision search algorithms, our variant has a constant-factor improved runtime. We give benchmarks that show the linear parallel performance of the attack on elliptic curves discrete logarithms and improved running times for meet-in-the-middle applications.
Video from TCHES 2021
BibTeX
@article{tches-2021-30799,
  title={Time-Memory Analysis of Parallel Collision Search Algorithms},
  journal={IACR Transactions on Cryptographic Hardware and Embedded Systems},
  publisher={Ruhr-Universität Bochum},
  volume={2021, Issue 2},
  pages={254-274},
  url={https://tches.iacr.org/index.php/TCHES/article/view/8794},
  doi={10.46586/tches.v2021.i2.254-274},
  author={Monika Trimoska and Sorina Ionica and Gilles Dequen},
  year=2021
}