Paper 2021/1421

Breaking the $IKEp182 Challenge

Aleksei Udovenko and Giuseppe Vitto

Abstract

We report a break of the $IKEp182 challenge using a meet-in-the-middle attack strategy improved with multiple SIKE-specific optimizations. The attack was executed on the HPC cluster of the University of Luxembourg and required less than 10 core-years and 256TiB of high-performance network storage (GPFS). Different trade-offs allow execution of the attack with similar time complexity and reduced storage requirements of only about 70TiB.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Preprint. Minor revision.
Keywords
IsogeniesCryptanalysisSIDHSIKE
Contact author(s)
giuseppe vitto @ uni lu
aleksei @ affine group
History
2021-10-24: received
Short URL
https://ia.cr/2021/1421
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2021/1421,
      author = {Aleksei Udovenko and Giuseppe Vitto},
      title = {Breaking the $IKEp182 Challenge},
      howpublished = {Cryptology ePrint Archive, Paper 2021/1421},
      year = {2021},
      note = {\url{https://eprint.iacr.org/2021/1421}},
      url = {https://eprint.iacr.org/2021/1421}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.